Lecture Notes in Computer Science - Reachability Problems
Latest Publications

TOTAL DOCUMENTS

15

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By Springer International Publishing

9783319245362, 9783319245379

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Multithreaded-Cartesian Abstract Interpretation of Multithreaded Recursive Programs Is Polynomial

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-24537-9_11 ◽

2015 ◽

pp. 114-127

Author(s):

Alexander Malkis

Keyword(s):

Abstract Interpretation ◽

Recursive Programs

Download Full-text

Reachability in Succinct One-Counter Games

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-24537-9_5 ◽

2015 ◽

pp. 37-49 ◽

Author(s):

Paul Hunter

Download Full-text

Reducing Bounded Realizability Analysis to Reachability Checking

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-24537-9_13 ◽

2015 ◽

pp. 140-152 ◽

Author(s):

Masaya Shimakawa ◽

Shigeki Hagihara ◽

Naoki Yonezaki

Download Full-text

Over-Approximating Terms Reachable by Context-Sensitive Rewriting

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-24537-9_12 ◽

2015 ◽

pp. 128-139 ◽

Author(s):

Nirina Andrianarivelo ◽

Pierre Réty

Keyword(s):

Context Sensitive

Download Full-text

Synthesis Problems for One-Counter Automata

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-24537-9_9 ◽

2015 ◽

pp. 89-100

Author(s):

Antonia Lechner

Download Full-text

A Topological Method for Finding Invariant Sets of Continuous Systems

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-24537-9_7 ◽

2015 ◽

pp. 63-75 ◽

Author(s):

Laurent Fribourg ◽

Eric Goubault ◽

Sameh Mohamed ◽

Marian Mrozek ◽

Sylvie Putot

Keyword(s):

Topological Method ◽

Invariant Sets ◽

Continuous Systems

Download Full-text

Reasoning About Cost-Utility Constraints in Probabilistic Models

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-24537-9_1 ◽

2015 ◽

pp. 1-6

Author(s):

Christel Baier

Keyword(s):

Probabilistic Models ◽

Download Full-text

Irregular Behaviours for Probabilistic Automata

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-24537-9_4 ◽

2015 ◽

pp. 33-36 ◽

Author(s):

Nathanaël Fijalkow ◽

Michał Skrzypczak

Keyword(s):

Probabilistic Automata

Download Full-text

Integer-Complete Synthesis for Bounded Parametric Timed Automata

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-24537-9_2 ◽

2015 ◽

pp. 7-19 ◽

Author(s):

Étienne André ◽

Didier Lime ◽

Olivier H. Roux

Keyword(s):

Timed Automata ◽

Complete Synthesis

Download Full-text

The Ideal View on Rackoff’s Coverability Technique

Lecture Notes in Computer Science - Reachability Problems ◽

10.1007/978-3-319-24537-9_8 ◽

2015 ◽

pp. 76-88 ◽

Author(s):

Ranko Lazić ◽

Sylvain Schmitz

Keyword(s):

Download Full-text