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
Journal ArticleDOI
On Decidability of LTL+Past Model Checking for Process Rewrite Systems
TL;DR: The paper shows that the model checking problem for (weakly extended) Process Rewrite Systems and properties given by LTL formulae with temporal operators strict eventually and strict always is decidable.
Book ChapterDOI
Visibly Pushdown Kleene Algebra and Its Use in Interprocedural Analysis of (Mutually) Recursive Programs
Claude Bolduc,Béchir Ktari +1 more
TL;DR: P visibly pushdown Kleene algebra is presented, an extension of Kleenegebra that axiomatises exactly the equational theory of visibly push down languages and can deal with some non-regular properties.
Journal ArticleDOI
Iterable Forward Reachability Analysis of Monitor-DPNs
TL;DR: This work considers the model of Monitor-DPNs for concurrent programs and implements the analysis for Java programs and applies it to information flow control and data race detection, resulting in an iterable, lock-sensitive forward reachability analysis.
Variablenelimination für symbolische Modelle.
Dirk Richter,Wolf Zimmermann +1 more
TL;DR: Experimentale zeigen, dass damit die Modellprufung beschleunigt bzw.
Posted Content
Pushdown Abstractions of JavaScript
David Van Horn,Matthew Might +1 more
TL;DR: This work designs a family of program analyses for JavaScript that make no approximation in matching calls with returns, exceptions with handlers, and breaks with labels, and gives pushdown generalizations of traditional forms of analysis such as k-CFA, and proves the pushdown framework for abstract interpretation is sound and computable.
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.