Book ChapterDOI
Reachability Analysis of Pushdown Automata: Application to Model-Checking
Ahmed Bouajjani,Javier Esparza,Oded Maler +2 more
- pp 135-150
Reads0
Chats0
TLDR
This work considers the more general class of alternating pushdown systems and uses alternating finite-state automata as a representation structure for sets of their configurations and gives a simple and natural procedure to compute sets of predecessors using this representation structure.Abstract:
We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finite-state automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (such as model-checking for branching-time logics), we consider the more general class of alternating pushdown systems and use alternating finite-state automata as a representation structure for sets of their configurations. We give a simple and natural procedure to compute sets of predecessors using this representation structure. We incorporate this procedure into the automata-theoretic approach to model-checking to define new model-checking algorithms for pushdown systems against both linear and branching-time properties. From these results we derive upper bounds for several model-checking problems as well as matching lower bounds.read more
Citations
More filters
Book ChapterDOI
Reachability analysis of Process Rewrite Systems
Ahmed Bouajjani,Tayssir Touili +1 more
TL;DR: This work develops automata techniques allowing to build finite representations of the forward/backward sets of reachable configurations of PRSs modulo various term structural equivalences (corresponding to properties of the operators of sequential composition and parallel composition).
Proceedings ArticleDOI
Analysis of SPKI/SDSI certificates using model checking
Somesh Jha,Thomas Reps +1 more
TL;DR: The SPKI/SDSI-to-PDS connection provides a framework for formalizing a variety of certificate-analysis problems and has computational significance: many analysis problems can be solved efficiently using existing algorithms for model checking pushdown systems.
Posted Content
Pushdown Control-Flow Analysis of Higher-Order Programs
TL;DR: A pushdown control-flow analysis framework, which is derived as an abstract interpretation of a CESK machine with an unbounded stack and marks the first polyvariant pushdown analysis of higher-order programs.
Book ChapterDOI
Pushdown module checking with imperfect information
TL;DR: This paper shows that pushdown module checking, which is by itself harder than pushdown model checking, becomes undecidable when the environment has imperfect information, and proves that with imperfect information about the control states, but a visible pushdown store, the problem is decidable.
Journal Article
Reachability in recursive markov decision processes
TL;DR: In this paper, it was shown that the qualitative extended reachability problem is decidable in polynomial time, and that the set of all configurations for which there is a winning strategy is effectively regular.
References
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Journal ArticleDOI
A theory of timed automata
Rajeev Alur,David L. Dill +1 more
TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.
Proceedings ArticleDOI
The temporal logic of programs
TL;DR: A unified approach to program verification is suggested, which applies to both sequential and parallel programs, and the main proof method is that of temporal reasoning in which the time dependence of events is the basic concept.
Journal Article
WHO Technical Report.
TL;DR: The Feather River Coordinated Resource Management Group (FR-CRM) has been restoring channel/ meadow/ floodplain systems in the Feather River watershed since 1985 and recognized the possibility of a significant change in carbon stocks in these restored meadows and valleys.
Journal ArticleDOI
Symbolic Boolean manipulation with ordered binary-decision diagrams
TL;DR: The OBDD data structure is described and a number of applications that have been solved by OBDd-based symbolic analysis are surveyed.