Journal of the ACM (JACM)
Propositional Logic: Deduction and Algorithms
Propositional Logic: Deduction and Algorithms
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)
Efficient theory combination via boolean search
Information and Computation - Special issue: Combining logical systems
Model-based Theory Combination
Electronic Notes in Theoretical Computer Science (ENTCS)
Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
CSIsat: Interpolation for LA+EUF
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Ground Interpolation for the Theory of Equality
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Constraint solving for interpolation
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Efficient interpolant generation in satisfiability modulo theories
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
A fast linear-arithmetic solver for DPLL(T)
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
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
A combination method for generating interpolants
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Efficient generation of craig interpolants in satisfiability modulo theories
ACM Transactions on Computational Logic (TOCL)
Constraint solving for interpolation
Journal of Symbolic Computation
An interpolating decision procedure for transitive relations with uninterpreted functions
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
Efficient interpolant generation in satisfiability modulo linear integer arithmetic
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
Flexible interpolation with local proof transformations
Proceedings of the International Conference on Computer-Aided Design
Solving recursion-free horn clauses over LI+UIF
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
From strong amalgamability to modularity of quantifier-free interpolation
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Complete instantiation-based interpolation
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
SMT proof checking using a logical framework
Formal Methods in System Design
Proof tree preserving interpolation
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Quantifier-free interpolation in combinations of equality interpolating theories
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We give a method for modular generation of ground interpolants in modern SMT solvers supporting multiple theories. Our method uses a novel algorithm to modify the proof tree obtained from an unsatifiability run of the solver into a proof tree without occurrences of troublesome "uncolorable" literals. An interpolant can then be readily generated using existing procedures. The principal advantage of our method is that it places few restrictions (none for convex theories) on the search strategy of the solver. Consequently, it is straightforward to implement and enables more efficient interpolating SMT solvers. In the presence of non-convex theories our method is incomplete, but still more general than previous methods.