A Complete Bounded Model Checking Algorithm for Pushdown Systems
- 1 February 2008
- book chapter
- Published by Springer Nature
- p. 202-217
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- SAT-Based Summarization for Boolean Programs2007
- Analysis of recursive state machinesACM Transactions on Programming Languages and Systems, 2005
- An Extensible SAT-solver2004
- Algorithmic Number Theory2004
- Efficient Computation of Recurrence Diameters2002
- Bebop: A Symbolic Model Checker for Boolean Programs2000
- Efficient Algorithms for Model Checking Pushdown Systems2000
- Construction of abstract state graphs with PVS1997
- A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract)Electronic Notes in Theoretical Computer Science, 1997
- Regular canonical systemsArchive for Mathematical Logic, 1964