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
Bounded Model Checking of Recursive Programs with Pointers in K
Irina Mariuca Asavoae,Frank S. de Boer,Frank S. de Boer,Marcello M. Bonsangue,Marcello M. Bonsangue,Dorel Lucanu,Jurriaan Rot,Jurriaan Rot +7 more
TL;DR: This work introduces the algebraic notion of pushdown system specifications (PSS) and adapt a model checking algorithm for this new notion and gives a parametric specification for model checking push down system specifications based on the adapted modelchecking algorithm for PSS.
Journal ArticleDOI
Modelling and analysis of PKI-based systems using process calculi
Benjamin Aziz,Geoff W. Hamilton +1 more
TL;DR: The new language, SPIKY, extends the spi-calculus by adding primitives for the retrieval of certified/uncertified public keys as well as private keys belonging to users of the PKI-based system by formalising the notion of process ownership by PKI users.
Book ChapterDOI
Verification of higher-order computation: a game-semantic approach
TL;DR: A theme of the work is the fruitful interplay of ideas between the neighbouring fields of semantics and verification in an approach to the verification of higher-order computation based on game semantics.
Journal Article
Symbolic reachability analysis of higher-order context-free processes
Ahmed Bouajjani,A. B. Meyer +1 more
TL;DR: For any higher-order context-free process, the set of all predecessors of a given regular set of configurations is regular and effectively constructible and it is shown that this result holds also in the case of backward reachability analysis under a regular constraint on configurations.
Book ChapterDOI
Testability of oracle automata
Gaoyan Xie,Cheng Li,Zhe Dang +2 more
TL;DR: The oracle O can always be queried with the answer whether a query string w is in O, and the name of “oracle” comes from the fact that, except for its language class, the definition of O is not given.
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.