Refinement and Term Synthesis in Loop Invariant Generation

Ewen Maclean, Andrew Ireland, Lucas Dixon, Robert Atkey · EPiC series in computing · 2018

We present a technique for refining incorrect or insufficiently strong loop invariants in correctness proofs for imperative programs. We rely on previous work [16] in combining program analysis and Proof Planning, and exploit IsaPlanner’s use of meta-variables and goal-naming to generate correct loop invariants. We present a simple example in detail and show how this scales to more complex problems.

Read the paper · More papers on PaperTik