Incorporating decision procedures in implicit induction

Authors:
Alessandro Armando;Michaël Rusinowitch;Sorin Stratulat
Affiliations:
DIST, Università di Genova, Viale Causa 13, 16145 Genova, Italy;LORIA-INRIA, 615, rue du Jardin Botanique, 54602 Villers lès Nancy, France;INRIA, 2004 route des Lucioles, BP 93, 06902 Sophia Antipolis, France
Venue:
Journal of Symbolic Computation - Integrated reasoning and algebra systems
Year:
2002

Citing 16
Cited 8

Contextual rewriting

Proc. of the first international conference on Rewriting techniques and applications
Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Integrating decision procedures into heuristic theorem provers: a case study of linear arithmetic

Machine intelligence 11
Rewrite systems

Handbook of theoretical computer science (vol. B)
On Fourier's algorithm for linear arithmetic constraints

Journal of Automated Reasoning
Automated theorem proving by test set induction

Journal of Symbolic Computation
Modern computer algebra

Modern computer algebra
A general framework to build contextual cover set

Journal of Symbolic Computation - Calculemus-99: integrating computation and deduction
Termination of Constraint Contextual Rewriting

FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
Reasoning About Functional Programs in Nuprl

Functional Programming, Concurrency, Simulation and Automated Reasoning: International Lecture Series 1991-1992, McMaster University, Hamilton, Ontario, Canada
Mechanical Verification of an Ideal Incremental ABR Conformance

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
PVS: A Prototype Verification System

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Automated Verification by Induction with Associative-Commutative Operators

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
On generic representation of implicit induction procedures

On generic representation of implicit induction procedures
Simplification by cooperating decision procedures

Simplification by cooperating decision procedures
Contextual Rewriting In Automated Reasoning

Fundamenta Informaticae

Formal design and verification of operational transformation algorithms for copies convergence

Theoretical Computer Science - Algebraic methodology and software technology
Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Strategic Issues, Problems and Challenges in Inductive Theorem Proving

Electronic Notes in Theoretical Computer Science (ENTCS)
An Even Closer Integration of Linear Arithmetic into Inductive Theorem Proving

Electronic Notes in Theoretical Computer Science (ENTCS)
On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs

WFLP'11 Proceedings of the 20th international conference on Functional and constraint logic programming
Automated certification of implicit induction proofs

CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Rewriting induction + linear arithmetic = decision procedure

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Applying a theorem prover to the verification of optimistic replication algorithms

Rewriting Computation and Proof

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an approach to integrating reasoning specialists into cover set induction based on constraint contextual rewriting. The approach has been successfully used to incorporate decision procedures into the SPIKE prover. Computer experiments on non-trivial verification problems illustrating the effectiveness of the proposed technique are given. The generality of the approach allows for the integration of computer algebra algorithms and techniques into induction theorem provers. To illustrate this, we discuss the integration of the Buchberger algorithm into our framework.