Efficient Interpolant Generation in Satisfiability Modulo Theories
- 2 April 2008
- book chapter
- Published by Springer Nature
- p. 397-412
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Array Abstractions from Proofs2007
- Efficient theory combination via boolean searchInformation and Computation, 2006
- Fast and Flexible Difference Constraint Propagation for DPLL(T)2006
- A Fast Linear-Arithmetic Solver for DPLL(T)2006
- A Practical and Complete Approach to Predicate Refinement2006
- Efficient Abstraction Refinement in Interpolation-Based Unbounded Model Checking2006
- MathSAT: Tight Integration of SAT and Mathematical Decision ProceduresJournal of Automated Reasoning, 2005
- Interpolant-Based Transition Relation Approximation2005
- Zap: Automated Theorem Proving for Software AnalysisLecture Notes in Computer Science, 2005
- Bounded Model Checking for Timed SystemsLecture Notes in Computer Science, 2002