### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 65-97 |

Number of pages | 33 |

Journal | Annals of Mathematics and Artificial Intelligence |

Volume | 29 |

Issue number | 1-4 |

Publication status | Published - 2000 |

### Fingerprint

### Keywords

- Invariant discovery
- Proof patching
- Proof planning
- Strategy development

### Cite this

*Annals of Mathematics and Artificial Intelligence*,

*29*(1-4), 65-97.

}

*Annals of Mathematics and Artificial Intelligence*, vol. 29, no. 1-4, pp. 65-97.

**Proof planning for strategy development.** / Ireland, Andrew; Stark, Jamie.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Proof planning for strategy development

AU - Ireland, Andrew

AU - Stark, Jamie

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

KW - Invariant discovery

KW - Proof patching

KW - Proof planning

KW - Strategy development

UR - http://www.scopus.com/inward/record.url?scp=0034563298&partnerID=8YFLogxK

M3 - Article

VL - 29

SP - 65

EP - 97

JO - Annals of Mathematics and Artificial Intelligence

JF - Annals of Mathematics and Artificial Intelligence

SN - 1012-2443

IS - 1-4

ER -