Loop Invariants on Demand

  • K. Rustan M. Leino
  • Francesco Logozzo
Conference paper

DOI: 10.1007/11575467_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3780)
Cite this paper as:
Leino K.R.M., Logozzo F. (2005) Loop Invariants on Demand. In: Yi K. (eds) Programming Languages and Systems. APLAS 2005. Lecture Notes in Computer Science, vol 3780. Springer, Berlin, Heidelberg

Abstract

This paper describes a sound technique that combines the precision of theorem proving with the loop-invariant inference of abstract interpretation. The loop-invariant computations are invoked on demand when the need for a stronger loop invariant arises, which allows a gradual increase in the level of precision used by the abstract interpreter. The technique generates loop invariants that are specific to a subset of a program’s executions, achieving a dynamic and automatic form of value-based trace partitioning. Finally, the technique can be incorporated into a lemmas-on-demand theorem prover, where the loop-invariant inference happens after the generation of verification conditions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • K. Rustan M. Leino
    • 1
  • Francesco Logozzo
    • 2
  1. 1.Microsoft ResearchRedmondUSA
  2. 2.Laboratoire d’Informatique de l’École Normale SupérieureParisFrance

Personalised recommendations