A PROLOG environment for developing and reasoning about data types
Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT) on Formal Methods and Software, Vol.2: Colloquium on Software Engineering (CSE)
Formulation of induction formulas in verification of PROLOG programs
Proc. of the 8th international conference on Automated deduction
Automatic inductive theorem proving using PROLOG
Theoretical Computer Science
A Prolog technology theorem prover: a new exposition and implementation in Prolog
Theoretical Computer Science - Selected papers on theoretical issues of design and implementation of symbolic computation systems
Proving Theorems about LISP Functions
Journal of the ACM (JACM)
Inductive methods for proving properties of programs
Communications of the ACM
Verification of Prolog Programs Using an Extension of Execution
Proceedings of the Third International Conference on Logic Programming
Proving the Equivalence of CLP Programs
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
HOL Light: A Tutorial Introduction
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
An unfold/fold transformation framework for definite logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A CLP Proof Method for Timed Automata
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Automated verification of shape and size properties via separation logic
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Coinductive logic programming and its applications
ICLP'07 Proceedings of the 23rd international conference on Logic programming
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
Recursive Abstractions for Parameterized Systems
FM '09 Proceedings of the 2nd World Congress on Formal Methods
On inductive and coinductive proofs via unfold/fold transformations
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
| Hi-index | 0.00 |
Recursively defined properties are ubiquitous. We present a proof method for establishing entailment $\mathcal{G} \models \mathcal{H}$ of such properties $\mathcal{G}$ and $\mathcal{H}$ over a set of common variables. The main contribution is a particular proof rule based intuitively upon the concept of coinduction. This rule allows the inductive step of assuming that an entailment holds during the proof the entailment. In general, the proof method is based on an unfolding (and no folding) algorithm that reduces recursive definitions to a point where only constraint solving is necessary. The constraint-based proof obligation is then discharged with available solvers. The algorithm executes the proof by a search-based method which automatically discovers the opportunity of applying induction instead of the user having to specify some induction schema, and which does not require any base case.