A Practical and Complete Approach to Predicate Refinement
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 459-473
- https://doi.org/10.1007/11691372_33
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Predicate Abstraction of ANSI-C Programs Using SATFormal Methods in System Design, 2004
- An Interpolating Theorem ProverLecture Notes in Computer Science, 2004
- Interpolation and SAT-Based Model CheckingLecture Notes in Computer Science, 2003
- Predicate Abstraction with Minimum PredicatesLecture Notes in Computer Science, 2003
- Lazy Theorem Proving for Bounded Model Checking over Infinite DomainsLecture Notes in Computer Science, 2002
- Relative Completeness of Abstraction Refinement for Software Model CheckingLecture Notes in Computer Science, 2002
- Incremental Verification by AbstractionLecture Notes in Computer Science, 2001
- Construction of abstract state graphs with PVSLecture Notes in Computer Science, 1997
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979
- Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theoryThe Journal of Symbolic Logic, 1957