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
Faster Pushdown Reachability Analysis with Applications in Network Verification
Peter Gjøl Jensen,Stefan Schmid,Morten Konggaard Schou,Jiří Srba,Juan Vanerio,Ingo van Duijn +5 more
Proceedings ArticleDOI
Domains for Higher-Order Games
TL;DR: In this paper, the authors study two-player inclusion games played over word-generating higher-order recursion schemes, where nonterminals of the grammar are controlled by opposing players.
Journal ArticleDOI
Abstracting abstract control
Dionna Glaze,David Van Horn +1 more
TL;DR: The abstracting abstract machines technique is revised to target the stronger computational model of pushdown systems, using only abstract machines and memoization in place of automata theory.
Book ChapterDOI
Synchronized Recursive Timed Automata
Yuya Uezato,Yasuhiko Minamide +1 more
TL;DR: The main contribution is to show that the reachability problem of SRTA is ExpTime-complete, and enlarges the decidable class of pushdown-extensions of timed automata.
Book ChapterDOI
Small Faults Grow Up - Verification of Error Masking Robustness in Arithmetically Encoded Programs
TL;DR: The increasing prevalence of soft errors and security concerns due to recent attacks like rowhammer have caused increased interest in the robustness of software against bit flips.
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.