Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Interpolant-based transition relation approximation
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Quantifier-free interpolation in combinations of equality interpolating theories
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
A Craig interpolant [1] 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. It is known that a Craig interpolant can be efficiently derived from a refutation of A ∧ B, for certain theories and proof systems. For example, interpolants can be derived from resolution proofs in propositional logic, and for systems of linear inequalities over the reals [6,4]. These methods have been recently extended to combine linear inequalities with uninterpreted function symbols, and to deal with integer models [5]. One key aspect of these procedures is that the yield quantifier-free interpolants when the premises A and B are quantifier-free.