Journal of the ACM (JACM)
Constructing Craig Interpolation Formulas
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
An interpolating theorem prover
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
A combination method for generating interpolants
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Coverage in interpolation-based model checking
Proceedings of the 47th Design Automation Conference
Beyond quantifier-free interpolation in extensions of Presburger arithmetic
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
An efficient and flexible approach to resolution proof reduction
HVC'10 Proceedings of the 6th international conference on Hardware and software: verification and testing
Predicate generation for learning-based quantifier-free loop invariant inference
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
On interpolation in decision procedures
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Incremental preprocessing methods for use in BMC
Formal Methods in System Design
Playing in the grey area of proofs
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Flexible interpolation with local proof transformations
Proceedings of the International Conference on Computer-Aided Design
Propositional interpolation and abstract interpretation
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
WOLVERINE: battling bugs with interpolants
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Interpolant strength revisited
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Leveraging interpolant strength in model checking
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Improved single pass algorithms for resolution proof reduction
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Complete instantiation-based interpolation
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proof tree preserving interpolation
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Lemma localization: a practical method for downsizing SMT-interpolants
Proceedings of the Conference on Design, Automation and Test in Europe
Optimization techniques for craig interpolant compaction in unbounded model checking
Proceedings of the Conference on Design, Automation and Test in Europe
A counterexample-guided interpolant generation algorithm for SAT-based model checking
Proceedings of the 50th Annual Design Automation Conference
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Efficient generation of small interpolants in CNF
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
Interpolant-based model checking is an approximate method for computing invariants of transition systems. The performance of the model checker is contingent on the approximation computed, which in turn depends on the logical strength of the interpolants. A good approximation is coarse enough to enable rapid convergence but strong enough to be contained within the weakest inductive invariant. We present a system for constructing propositional interpolants of different strength from a resolution refutation. This system subsumes existing methods and allows interpolation systems to be ordered by the logical strength of the obtained interpolants. Interpolants of different strength can also be obtained by transforming a resolution proof. We analyse an existing proof transformation, generalise it, and characterise the interpolants obtained.