Interpolants and symbolic model checking

Authors:
K. L. McMillan
Affiliations:
Cadence Berkeley Labs
Venue:
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Year:
2007

Citing 4
Cited 1

Abstractions from proofs

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An interpolating theorem prover

Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Lazy abstraction with interpolants

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Interpolant-based transition relation approximation

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification

Finding guaranteed MUSes fast

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An interpolant for a mutually inconsistent pair of formulas (A,B) is a formula that is (1) implied by A, (2) inconsistent with B, and (3) expressed over the common variables of A and B. An interpolant can be efficiently derived from a refutation of A∧B, for certain theories and proof systems. In this tutorial we will cover methods of generating interpolants, and applications of interpolants, including invariant generation and abstraction refinement.