Refinement and Term Synthesis in Loop Invariant Generation

16 pages•Published: June 22, 2012

Ewen Maclean, Andrew Ireland, Lucas Dixon and Robert Atkey

Abstract

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.

In: Andrei Voronkov, Laura Kovacs and Nikolaj Bjorner (editors). WING 2010. Workshop on Invariant Generation 2010, vol 1, pages 167-182.

Links:	https://easychair.org/publications/paper/J
	https://doi.org/10.29007/5wpt

BibTeX entry

@inproceedings{WING2010:Refinement_Term_Synthesis_Loop,
  author    = {Ewen Maclean and Andrew Ireland and Lucas Dixon and Robert Atkey},
  title     = {Refinement and Term Synthesis in Loop Invariant Generation},
  booktitle = {WING 2010. Workshop on Invariant Generation 2010},
  editor    = {Andrei Voronkov and Laura Kovacs and Nikolaj Bjorner},
  series    = {EPiC Series in Computing},
  volume    = {1},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/J},
  doi       = {10.29007/5wpt},
  pages     = {167-182},
  year      = {2012}}

Download PDF Open PDF in browser