Loop Summarization and Termination Analysis

  • Aliaksei Tsitovich
  • Natasha Sharygina
  • Christoph M. Wintersteiger
  • Daniel Kroening
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6605)

Abstract

We present a technique for program termination analysis based on loop summarization. The algorithm relies on a library of abstract domains to discover well-founded transition invariants. In contrast to state-of-the-art methods it aims to construct a complete ranking argument for all paths through a loop at once, thus avoiding expensive enumeration of individual paths. Compositionality is used as a completeness criterion for the discovered transition invariants. The practical efficiency of the approach is evaluated using a set of Windows device drivers.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Aliaksei Tsitovich
    • 1
  • Natasha Sharygina
    • 1
  • Christoph M. Wintersteiger
    • 2
  • Daniel Kroening
    • 2
  1. 1.Formal Verification and Security GroupUniversity of LuganoSwitzerland
  2. 2.Computing LaboratoryOxford UniversityUK

Personalised recommendations