UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Reachability Problems: 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings

1, 2017

Volltextzugriff (PDF)

Saturation algorithms for model-checking pushdown systems

Electronic proceedings in theoretical computer science, 2014-05, Vol.151 (Proc. AFL 2014), p.1-24

2014

Volltextzugriff (PDF)

Copyful Streaming String Transducers

Fundamenta informaticae, 2021-01, Vol.178 (1-2), p.59-76

2021

Volltextzugriff (PDF)

Probabilistic Timed Automata with Clock-Dependent Probabilities

Fundamenta informaticae, 2021-01, Vol.178 (1-2), p.101-138

2021

Volltextzugriff (PDF)

Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction

Fundamenta informaticae, 2021-01, Vol.178 (1-2), p.31-57

2021

Volltextzugriff (PDF)

The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic

Fundamenta informaticae, 2021-01, Vol.178 (1-2), p.1-30

2021

Volltextzugriff (PDF)

Preface

Fundamenta informaticae, 2021-01, Vol.178 (1-2), p.v-vi

2021

Volltextzugriff (PDF)

Topological Characterisation of Multi-Buffer Simulation

Fundamenta informaticae, 2021-01, Vol.178 (1-2), p.77-99

2021

Volltextzugriff (PDF)

Stubborn Sets, Frozen Actions, and Fair Testing

Fundamenta informaticae, 2021-01, Vol.178 (1-2), p.139-172

2021

Volltextzugriff (PDF)

Decidable models of integer-manipulating programs with recursive parallelism

Theoretical computer science, 2018-11, Vol.750, p.24-37

2018

Volltextzugriff (PDF)

How to investigate: Chronic pain

Best practice & research. Clinical rheumatology, 2014-12, Vol.28 (6), p.860-874

2014

Volltextzugriff (PDF)

Refinement of Trace Abstraction for Real-Time Programs

Reachability Problems, 2017, Vol.10506, p.42-58

2017

Volltextzugriff (PDF)

Audit of positive predictive value (PPV) of age and symptom combinations in one stop breast clinics

European journal of surgical oncology, 2023-05, Vol.49 (5), p.e253-e254

2023

Volltextzugriff (PDF)

Use of a non‐anatomic mini‐fragment fixation system for foot fractures

ANZ journal of surgery, 2023-07, Vol.93 (7-8), p.1924-1929

2023

Volltextzugriff (PDF)

Nailing distal tibial fractures: does entry technique affect distal alignment?

European journal of orthopaedic surgery & traumatology, 2023-01, Vol.33 (1), p.61-66

2023

Volltextzugriff (PDF)

Decision procedures for path feasibility of string-manipulating programs with complex operations

Proceedings of ACM on programming languages, 2019-01, Vol.3 (POPL), p.1-30

2019

Volltextzugriff (PDF)

Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems

Logical methods in computer science, 2008-12, Vol.4, Issue 4

2008

Volltextzugriff (PDF)

Decidable Models of Integer-Manipulating Programs with Recursive Parallelism

Reachability Problems, 2016, Vol.9899, p.148-162

2016

Volltextzugriff (PDF)

CSS Minification via Constraint Solving

ACM transactions on programming languages and systems, 2019-06, Vol.41 (2), p.1-76, Article 12

2019

Volltextzugriff (PDF)

Parikh’s Theorem Made Symbolic

Proceedings of ACM on programming languages, 2024-01, Vol.8 (POPL), p.1945-1977, Article 65

2024

Volltextzugriff (PDF)

What is decidable about string constraints with the ReplaceAll function

Proceedings of ACM on programming languages, 2018-01, Vol.2 (POPL), p.1-29

2018

Volltextzugriff (PDF)

Solving string constraints with Regex-dependent functions through transducers with priorities and variables

Proceedings of ACM on programming languages, 2022-01, Vol.6 (POPL), p.1-31

2022

Volltextzugriff (PDF)

Copyful Streaming String Transducers

Reachability Problems, 2017, Vol.10506, p.75-86

2017

Volltextzugriff (PDF)

Distributed Control Synthesis Using Euler's Method

Reachability Problems, 2017, Vol.10506, p.118-131

2017

Volltextzugriff (PDF)

Constrained Dynamic Tree Networks

Reachability Problems, 2018, Vol.11123, p.45-58

2018

Volltextzugriff (PDF)

1 – 25 von 169

Menü

Weitere Dienste

Einstellungen

Reachability Problems: 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings

Saturation algorithms for model-checking pushdown systems

Copyful Streaming String Transducers

Probabilistic Timed Automata with Clock-Dependent Probabilities

Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction

The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic

Preface

Topological Characterisation of Multi-Buffer Simulation

Stubborn Sets, Frozen Actions, and Fair Testing

Decidable models of integer-manipulating programs with recursive parallelism

How to investigate: Chronic pain

Refinement of Trace Abstraction for Real-Time Programs

Audit of positive predictive value (PPV) of age and symptom combinations in one stop breast clinics

Use of a non‐anatomic mini‐fragment fixation system for foot fractures

Nailing distal tibial fractures: does entry technique affect distal alignment?

Decision procedures for path feasibility of string-manipulating programs with complex operations

Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems

Decidable Models of Integer-Manipulating Programs with Recursive Parallelism

CSS Minification via Constraint Solving

Parikh’s Theorem Made Symbolic

What is decidable about string constraints with the ReplaceAll function

Solving string constraints with Regex-dependent functions through transducers with priorities and variables

Copyful Streaming String Transducers

Distributed Control Synthesis Using Euler's Method

Constrained Dynamic Tree Networks

Suchergebnisse filtern