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
Posted Content
A First-Order Complete Temporal Logic for Structured Context-Free Languages.
TL;DR: In this paper, the OPL-based logic POTL is defined and proved FO-completeness, and a model checking procedure is presented for this logic based on a prototype tool developed therefor.
Posted Content
Cut-elimination and the decidability of reachability in alternating pushdown systems
Gilles Dowek,Ying Jiang +1 more
TL;DR: The decidability of reachability can be proved as a simple consequence of a cut-elimination theorem for the corresponding inference system, and this result can be used to extend an alternating pushdown system into a complete system where, for every configuration, either $A$ or $
eg A$ is provable.
An Alternative Direct Simulation of Minsky Machines into Classical Bunched Logics via Group Semantics (full version)
TL;DR: In this paper, an alternative direct simulation of Minsky machines into both BBI and CBI was proposed, based on a fragment of BBI called eBBI, which is common to the BBI/CBI families of logics.
Reasoning about Dynamic Networks of Infinite-State Processes with Global Synchronization
TL;DR: It is proved that the $\exists^* \forall^*$ fragment of CTSL is decidable whenever the underlying logic for expressing constraints on colors isDecidable, and it is shown that the same fragment is closed under post and pre image computations.
Journal ArticleDOI
Decidability Issues for Extended Ping-Pong Protocols
TL;DR: It is shown that reachability analysis for a replicative variant of the protocol becomes decidable, and the calculus is capable of an implicit description of the active intruder, including full analysis and synthesis of messages in the sense of Amadio, Lugiez, and Vanackère.
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.