Interpolant-Based Transition Relation Approximation
- 1 January 2005
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- An interpolating theorem proverTheoretical Computer Science, 2005
- Abstractions from proofsPublished by Association for Computing Machinery (ACM) ,2004
- A Symbolic Approach to Predicate AbstractionPublished by Springer Nature ,2003
- Interpolation and SAT-Based Model CheckingPublished by Springer Nature ,2003
- Successive approximation of abstract transition relationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The S LAM projectPublished by Association for Computing Machinery (ACM) ,2002
- Counterexample-Guided Abstraction RefinementPublished by Springer Nature ,2000
- Symbolic Model Checking without BDDsPublished by Springer Nature ,1999
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmeticThe Journal of Symbolic Logic, 1997
- Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theoryThe Journal of Symbolic Logic, 1957