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
Proceedings ArticleDOI
Compositional verification for secure loading of smart card applets
TL;DR: This work presents an algorithmic compositional verification method for smart card applets and control flow based safety properties expressed in a modal logic with simultaneous greatest fixed points, and presents a novel maximal model construction for this logic and then adapts it to applets.
Book ChapterDOI
Proxi-Annotated control flow graphs: deterministic context-sensitive monitoring for intrusion detection
Samik Basu,Prem Uppuluri +1 more
TL;DR: A novel model generated using static analysis of executables (binary code) is discussed, called proxi-annotated control flow graph, which is as precise as previous approaches which use context sensitive push down models and enhances the runtime efficiency of such models.
Book ChapterDOI
An Automata Approach to Some Problems on Context-Free Grammars
Javier Esparza,Peter Rossmanith +1 more
TL;DR: In Chapter 4 of [2], Book and Otto solve a number of word problems for monadic string-rewriting systems using an elegant automata-based technique using a uniform solution to several elementary problems on context-free languages.
Book ChapterDOI
Reachability and Safety in Queue Systems
TL;DR: It is shown that it is decidable to determine, given a queue system M, whether there is some computation in which R attempts to read from an empty queue, and other verification problems that are solvable include (binary, forward, and backward) reachability, safety, invariance, etc.
Book ChapterDOI
On the complexity of LTL model-checking of recursive state machines
TL;DR: This paper systematically study the computational complexity of modelchecking RSMS against several syntactic fragments of LTL, and shows that if in the specification the authors disallow next and until, and retain only the box and diamond operators, model-checking is in NP.
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.