Equational formulae with membership constraints
Information and Computation
Modal logics, description logics and arithmetic reasoning
Artificial Intelligence
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automated complexity analysis based on ordered resolution
Journal of the ACM (JACM)
Polynomial-time computation via local inference relations
ACM Transactions on Computational Logic (TOCL)
Ordered Semantic Hyper-Linking
Journal of Automated Reasoning
New Directions in Instantiation-Based Theorem Proving
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Simplify: a theorem prover for program checking
Journal of the ACM (JACM)
Modular proof systems for partial functions with Evans equality
Information and Computation - Special issue: Combining logical systems
Decision procedures for extensions of the theory of arrays
Annals of Mathematics and Artificial Intelligence
The Calculus of Computation: Decision Procedures with Applications to Verification
The Calculus of Computation: Decision Procedures with Applications to Verification
Efficient E-Matching for SMT Solvers
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Deciding array formulas with frugal axiom instantiation
SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Annals of Mathematics and Artificial Intelligence
Solving quantified verification conditions using satisfiability modulo theories
Annals of Mathematics and Artificial Intelligence
Decidable fragments of many-sorted logic
Journal of Symbolic Computation
On local reasoning in verification
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
What else is decidable about integer arrays?
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Superposition modulo linear arithmetic SUP(LA)
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Combinations of theories for decidable fragments of first-order logic
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Instantiation of SMT problems modulo integers
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Information Processing Letters
On Deciding Satisfiability by Theorem Proving with Speculative Inferences
Journal of Automated Reasoning
What's decidable about arrays?
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Data structure specifications via local equality axioms
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Hierarchic reasoning in local theory extensions
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
An Instantiation Scheme for Satisfiability Modulo Theories
Journal of Automated Reasoning
Hierarchical reasoning for the verification of parametric systems
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
| Hi-index | 0.00 |
This article investigates under which conditions instantiation-based proof procedures can be combined in a nested way, in order to mechanically construct new instantiation procedures for richer theories. Interesting applications in the field of verification are emphasized, particularly for handling extensions of the theory of arrays.