Deciding Combinations of Theories
Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A rewriting approach to satisfiability procedures
Information and Computation - RTA 2001
Model-Theoretic Methods in Combined Constraint Satisfiability
Journal of Automated Reasoning
Efficient theory combination via boolean search
Information and Computation - Special issue: Combining logical systems
A comprehensive combination framework
ACM Transactions on Computational Logic (TOCL)
On Variable-inactivity and Polynomial T-Satisfiability Procedures
Journal of Logic and Computation
Automatic Decidability and Combinability Revisited
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Noetherianity and Combination Problems
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
New results on rewrite-based satisfiability procedures
ACM Transactions on Computational Logic (TOCL)
Combined satisfiability modulo parametric theories
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
On superposition-based satisfiability procedures and their combination
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Combinable Extensions of Abelian Groups
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Theory-specific automated reasoning
A 25-year perspective on logic programming
| Hi-index | 0.00 |
We present a novel technique to combine satisfiability procedures for theories that model some data-structures and that share the integer offsets. This procedure extends the Nelson-Oppen approach to a family of non-disjoint theories that have practical interest in verification. The result is derived by showing that the considered theories satisfy the hypotheses of a general result on non-disjoint combination. In particular, the capability of computing logical consequences over the shared signature is ensured in a non trivial way by devising a suitable complete superposition calculus.