Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Gordon (1988)
HOL: A Proof Generating System for Higher-Order Logic
J. Barnes, Praxis Limited (1997)
High Integrity Ada: The Spark Approach
A. Kaldewaij (1990)
Programming: The Derivation Of Algorithms
R.W. Floyd (1967)
Mathematical Aspects of Computer Science
R. Constable, S. Allen, Mark Bromley, R. Cleaveland, J. Cremer, R. Harper, Douglas Howe, Todd Knoblock, N. Mendler, P. Panangaden, James Sasaki, Scott Smith (1986)
Implementing mathematics with the Nuprl proof development system
A. Mili, J. Desharnais, F. Mili, M. Frappier (1994)
Computer Program Construction
Gilles Dowek, A. Felty, Hugo Herbelin, G. Huet, Benjamin Werner, Christine Paulin-Mohring (1990)
The Coq proof assistant user's guide : version 5.6
B. Wegbreit (1973)
Heuristic Methods for Mechanically Deriving Inductive Assertions
A. Bundy, A. Stevens, F. Harmelen, Andrew Ireland, A. Smaill (1993)
Rippling: A Heuristic for Guiding Inductive ProofsArtif. Intell., 62
(1979)
Scherlis, Stanford pascal verifier user manual, Research report CS-TR-79-731, Stanford University, Department
D.I. Good (1985)
Mathematical Logic and Programming Languages
D. Basin, T. Walsh (1996)
A calculus for and termination of ripplingJournal of Automated Reasoning, 16
B. Wegbreit (1974)
The synthesis of loop predicatesCommun. ACM, 17
D. Miller, G. Nadathur (1988)
Proceedings of the Fifth International Logic Programming Conference/ Fifth Symposium on Logic Programming
Andrew Ireland, A. Bundy (1999)
Automatic verification of functions with accumulating parametersJournal of Functional Programming, 9
D. Luckham, S. German, F. Henke, R. Karp, P. Milne, D. Oppen, W. Polak, W. Scherlis (1979)
Stanford Pascal Verifier user manual
R. Boyer, J. Moore (1979)
A computational logic handbook, 23
F. Kröger (1987)
Temporal Logic of Programs, 8
E. Dijkstra (1976)
A Discipline of Programming
D. Good, R. London, W. Bledsoe (1975)
An interactive program verification systemIEEE Transactions on Software Engineering, SE-1
M.J. Gordon (1988)
VLSI Specification, Verifi-cation and Synthesis
C.A.R. Hoare (1969)
An axiomatic basis for computer programmingComm. ACM, 12
A. Bundy, F. Harmelen, Christian Horn, A. Smaill (1990)
The Oyster-Clam System
R. Backhouse (1986)
Program construction and verification
D. Guaspari, C. Marceau, W. Polak (1990)
Formal Verification of Ada Programs
D. Good (1984)
Mechanical proofs about computer programsPhilosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences, 312
Jamie Stark, Andrew Ireland (1998)
Invariant Discovery via Failed Proof Attempts
D. Gries (1981)
The Science of Programming
A. Ireland (1992)
International Conference on Logi Programming and Automated Reasoning
Andrew Ireland (1996)
Productive use of failure in inductive proofJournal of Automated Reasoning, 16
A. Bundy (1988)
The Use of Explicit Plans to Guide Inductive Proofs
A. Bundy (1988)
9th International Conference on Automated Deduction
R. Floyd (1993)
Assigning Meanings to Programs
Ritu Chadha, D. Plaisted (1993)
On the Mechanical Derivation of Loop InvariantsJ. Symb. Comput., 15
N. Dershowitz, Z. Manna (1978)
Inference Rules for Program AnnotationIEEE Transactions on Software Engineering, SE-7
(1992)
Lego proof development system: User’s manual
M. Gordon (1979)
Edinburgh LCF: A mechanised logic of computation
Andrew Ireland (1992)
The Use of Planning Critics in Mechanizing Inductive Proofs
J. Stark, A. Ireland (1998)
Logic-Based Program Synthesis and Transformation
Chadha, Plaisted (1993)
On the mechanical derivation of loop invariantsJ. Symbolic Logic, 15
Jamie Stark (2000)
Proof planning for imperative program development
M. Gordon (1989)
Mechanizing programming logics in higher order logic
Z. Manna, A. Pnueli (1995)
Temporal verification of reactive systems - safety
R. Boulton, K. Slind, A. Bundy, M. Gordon (1998)
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'98)
R. Boulton, Konrad Slind, A. Bundy, M. Gordon (1998)
An Interface between Clam and HOL
G. Nadathur, D. Miller (1988)
AN OVERVIEW OF PROLOG
J. King (1971)
A Program Verifier
M. Caplain (1975)
Finding Invariant assertions for proving programs
Lawrence Paulson, T. Nipkow (1994)
Isabelle: A Generic Theorem Prover
S. German, B. Wegbreit (1975)
A synthesizer of inductive assertionsIEEE Transactions on Software Engineering, SE-1
Andrew Ireland, A. Bundy (1996)
Extensions to a Generalization Critic for Inductive Proof
Shmuel Katz, Z. Manna (1976)
Logical analysis of programsCommun. ACM, 19
Z. Manna, A. Pnueli (1995)
Temporal Verification of Reactive Systems
Peter Deutsch (1973)
An interactive program verifier
Shmuel Katz, Z. Manna (1973)
A Heuristic Approach to Program Verification
M. Gordon (1995)
The semantic challenge of Verilog HDLProceedings of Tenth Annual IEEE Symposium on Logic in Computer Science
Andrew Ireland, Jamie Stark (1997)
On the Automatic Discovery of Loop Invariants
A. Mili, J. Desharnais, J. Gagné (1985)
Strongest invariant functions: Their use in the systematic analysis of while statementsActa Informatica, 22
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.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 1, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.