Program construction and verification
Program construction and verification
Programming: the derivation of algorithms
Programming: the derivation of algorithms
On the mechanical derivation of loop invariants
Journal of Symbolic Computation - Special issue on automatic programming
Rippling: a heuristic for guiding inductive proofs
Artificial Intelligence
Computer program construction
An axiomatic basis for computer programming
Communications of the ACM
A Discipline of Programming
The Use of Planning Critics in Mechanizing Inductive Proofs
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Higher-Order Annotated Terms for Proof Search
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
The Use of Explicit Plans to Guide Inductive Proofs
Proceedings of the 9th International Conference on Automated Deduction
Proceedings of the 10th International Conference on Automated Deduction
Extensions to a Generalization Critic for Inductive Proof
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A Note on the Standard Strategy for Developing Loop Invariants and Loops
A Note on the Standard Strategy for Developing Loop Invariants and Loops
A heuristic approach to program verification
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Heuristic methods for mechanically deriving inductive assertio
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Relational rippling: a general approach
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Tool Integration for Reasoned Programming
Verified Software: Theories, Tools, Experiments
Generating counterexamples for structural inductions by exploiting nonstandard models
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Mechanical theorem proving in computational geometry
ADG'04 Proceedings of the 5th international conference on Automated Deduction in Geometry
European collaboration on automated reasoning
AI Communications - ECAI 2012 Turing and Anniversary Track
| Hi-index | 0.00 |
We present a framework for automating the discovery of loop invariants based upon failed proof attempts. The discovery of suitable loop invariants represents a bottleneck for automatic verification of imperative programs. Using the proof planning framework we reconstruct standard heuristics for developing invariants. We relate these heuristics to the analysis of failed proof attempts allowing us to discover invariants through a process of refinement.