A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract)
Open Access
- 1 January 1997
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 9, 27-37
- https://doi.org/10.1016/s1571-0661(05)80426-8
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A partial approach to model checkingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Actions speak louder than words: proving bisimilarity for context-free processesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Simple On-the-fly Automatic Verification of Linear Temporal LogicPublished by Springer Nature ,1996
- Pushdown processes: Games and model checkingPublished by Springer Nature ,1996
- Symbolic verification of communication protocols with infinite state spaces using QDDsPublished by Springer Nature ,1996
- An automata-theoretic approach to branching-time model checking (Extended abstract)Published by Springer Nature ,1994
- On the regular structure of prefix rewritingTheoretical Computer Science, 1992
- Memory-efficient algorithms for the verification of temporal propertiesFormal Methods in System Design, 1992
- Modalities for model checking (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- The theory of ends, pushdown automata, and second-order logicTheoretical Computer Science, 1985