Efficient Abstraction Refinement in Interpolation-Based Unbounded Model Checking
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 227-241
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Abstraction refinement in symbolic model checking using satisfiability as the only decision procedureInternational Journal on Software Tools for Technology Transfer, 2005
- Abstraction Refinement for Bounded Model Checking2005
- Improvements to the Implementation of Interpolant-Based Model CheckingLecture Notes in Computer Science, 2005
- Proving More Properties with Bounded Model CheckingLecture Notes in Computer Science, 2004
- Automatic Abstraction without Counterexamples2003
- Interpolation and SAT-Based Model Checking2003
- SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques2002
- Applying SAT Methods in Unbounded Symbolic Model Checking2002
- Checking Safety Properties Using Induction and a SAT-Solver2000
- Symbolic Model Checking without BDDs1999