Mechanical proofs about computer programs
Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
Program construction and verification
Program construction and verification
Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
A computational logic handbook
A computational logic handbook
Programming: the derivation of algorithms
Programming: the derivation of algorithms
Formal Verification of Ada Programs
IEEE Transactions on Software Engineering
Mechanizing programming logics in higher order logic
Current trends in hardware verification and automated theorem proving
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
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Communications of the ACM
The synthesis of loop predicates
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
The Science of Programming
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
An Interface between Clam and HOL
Proceedings of the 11th 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
The Semantic Challenge of Verilog HDL
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Finding Invariant assertions for proving programs
Proceedings of the international conference on Reliable software
A program verifier
Automatic verification of functions with accumulating parameters
Journal of Functional Programming
Higher Order Function Synthesis Through Proof Planning
Proceedings of the 16th IEEE international conference on Automated software engineering
Combining Proof Plans with Partial Order Planning for Imperative Program Synthesis
Automated Software Engineering
An Integrated Approach to High Integrity Software Verification
Journal of Automated Reasoning
Cooperative reasoning for automatic software verification
Proceedings of the second workshop on Automated formal methods
Tool Integration for Reasoned Programming
Verified Software: Theories, Tools, Experiments
Cooperating reasoning processes: more than just the sum of their parts
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Reasoned modelling critics: turning failed proofs into modelling guidance
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Reasoned modelling critics: Turning failed proofs into modelling guidance
Science of Computer Programming
| Hi-index | 0.00 |
Proof planning extends the tactic-based theorem proving paradigm through the explicit representation of proof strategies. We see three key benefits to the proof planning approach to the development of proof strategies: flexibility, re-usability and synergy. Here we demonstrate these benefits in terms of reasoning about imperative programs where we reuse strategies developed previously for proof by mathematical induction. In particular, we focus upon strategies for automating the discovery of loop invariants. Our approach tightly couples the discovery of invariants with the process of patching proof strategy failures.