Reachability analysis of pushdown automata: Application to model-checking
- 1 January 1997
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 135-150
- https://doi.org/10.1007/3-540-63141-0_10
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Model checking for context-free processesPublished by Springer Science and Business Media LLC ,2006
- Symbolic verification of communication protocols with infinite state spaces using QDDsLecture Notes in Computer Science, 1996
- Automated temporal reasoning about reactive systemsPublished by Springer Science and Business Media LLC ,1996
- Symbolic controller synthesis for discrete and timed systemsLecture Notes in Computer Science, 1995
- Symbolic Model CheckingPublished by Springer Science and Business Media LLC ,1993
- String-Rewriting SystemsPublished by Springer Science and Business Media LLC ,1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Verifying Temporal Properties of SystemsPublished by Springer Science and Business Media LLC ,1992
- Automatic verification of finite state concurrent system using temporal logic specificationsPublished by Association for Computing Machinery (ACM) ,1983
- The temporal logic of programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977