Efficient Algorithms for Model Checking Pushdown Systems
Top Cited Papers
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 232-247
- https://doi.org/10.1007/10722167_20
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Efficient algorithms for pre* and post* on interprocedural parallel flow graphsPublished by Association for Computing Machinery (ACM) ,2000
- Efficient Algorithms for Model Checking Pushdown SystemsPublished by Springer Nature ,2000
- An Automata-Theoretic Approach to Interprocedural Data-Flow AnalysisPublished by Springer Nature ,1999
- Program Analysis as Model Checking of Abstract InterpretationsPublished by Springer Nature ,1998
- Model checking the full modal mu-calculus for infinite sequential processesPublished by Springer Nature ,1997
- Reachability analysis of pushdown automata: Application to model-checkingPublished by Springer Nature ,1997
- A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract)Electronic Notes in Theoretical Computer Science, 1997
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972