Behavioural theories and the proof of behavioural properties
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Combining Multisets with Integers
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Combining Nonstably Infinite Theories
Journal of Automated Reasoning
Connecting many-sorted structures and theories through adjoint functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Hierarchic reasoning in local theory extensions
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Connecting many-sorted theories
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
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)
Annals of Mathematics and Artificial Intelligence
Combined satisfiability modulo parametric theories
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Ordered sets in the calculus of data structures
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Automatic decidability and combinability
Information and Computation
A theory of skiplists with applications to the verification of concurrent datatypes
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Sort it out with monotonicity: translating between many-sorted and unsorted first-order logic
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Sharing is caring: combination of theories
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Decision procedures for the formal analysis of software
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
On superposition-based satisfiability procedures and their combination
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Being careful about theory combination
Formal Methods in System Design
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Automating separation logic using SMT
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
Most computer programs store elements of a given nature into container-based data structures such as lists, arrays, sets, and multisets. To verify the correctness of these programs, one needs to combine a theory S modeling the data structure with a theory T modeling the elements. This combination can be achieved using the classic Nelson-Oppen method only if both S and T are stably infinite. The goal of this paper is to relax the stable infiniteness requirement. To achieve this goal, we introduce the notion of polite theories, and we show that natural examples of polite theories include those modeling data structures such as lists, arrays, sets, and multisets. Furthemore, we provide a method that is able to combine a polite theory S with any theory T of the elements, regardless of whether T is stably infinite or not. The results of this paper generalize to many-sorted logic those recently obtained by Tinelli and Zarba concerning the combination of shiny theories with nonstably infinite theories in one-sorted logic.