Automatic recognition of tractability in inference relations
Journal of the ACM (JACM)
Superposition theorem proving for abelian groups represented as integer modules
Theoretical Computer Science - Special issue on rewriting techniques and applications
Renaming a Set of Clauses as a Horn Set
Journal of the ACM (JACM)
Reasoning About Recursively Defined Data Structures
Journal of the ACM (JACM)
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)
Automated theorem proving in software engineering
Automated theorem proving in software engineering
The SLAM project: debugging system software via static analysis
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of Theoretical Computer Science
Handbook of Theoretical Computer Science
Polynomial-time computation via local inference relations
ACM Transactions on Computational Logic (TOCL)
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Theorem Proving in Cancellative Abelian Monoids (Extended Abstract)
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Superposition for Divisible Torsion-Free Abelian Groups
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
A rewriting approach to satisfiability procedures
Information and Computation - RTA 2001
Superposition with completely built-in Abelian groups
Journal of Symbolic Computation
Simplify: a theorem prover for program checking
Journal of the ACM (JACM)
Combining Nonstably Infinite Theories
Journal of Automated Reasoning
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Automatic Decidability and Combinability Revisited
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Splitting without backtracking
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Using first-order theorem provers in the Jahob data structure verification system
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
The Why/Krakatoa/Caduceus platform for deductive program verification
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Automatic combinability of rewriting-based satisfiability procedures
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Nelson-Oppen, shostak and the extended canonizer: a family picture with a newborn
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Decidability and undecidability results for nelson-oppen and rewrite-based decision procedures
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Combining data structures with nonstably infinite theories using many-sorted logic
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
On superposition-based satisfiability procedures and their combination
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Modular termination and combinability for superposition modulo counter arithmetic
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
A rule-based framework for building superposition-based decision procedures
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
SMELS: Satisfiability Modulo Equality with Lazy Superposition
Journal of Automated Reasoning
Hi-index | 0.00 |
Verification problems can often be encoded as first-order validity or satisfiability problems. The availability of efficient automated theorem provers is a crucial pre-requisite for automating various verification tasks as well as their cooperation with specialized decision procedures for selected theories, such as Presburger Arithmetic. In this paper, we investigate how automated provers based on a form of equational reasoning, called paramodulation, can be used in verification tools. More precisely, given a theory T axiomatizing some data structure, we devise a procedure to answer the following questions. Is the satisfiability problem of T decidable by paramodulation? Can a procedure based on paramodulation for T be efficiently combined with other specialized procedures by using the Nelson-Oppen schema? Finally, if paramodulation decides the satisfiability problem of two theories, does it decide satisfiability in their union? The procedure capable of answering all questions above is based on Schematic Saturation; an inference system capable of over-approximating the inferences of paramodulation when solving satisfiability problems in a given theory T. Clause schemas derived by Schematic Saturation describe all clauses derived by paramodulation so that the answers to the questions above are obtained by checking that only finitely many different clause schemas are derived or that certain clause schemas are not derived.