Termination Analysis with Compositional Transition Invariants

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

Abstract

Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the procedure. We present an alternative algorithm that uses a light-weight check based on transitivity of ranking relations to prove program termination. We provide an experimental evaluation over a set of 87 Windows drivers, and demonstrate that our algorithm is often able to conclude termination by examining only a small fraction of the program. As a consequence, our algorithm is able to outperform known approaches by multiple orders of magnitude.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Daniel Kroening
    • 1
  • Natasha Sharygina
    • 2
    • 4
  • Aliaksei Tsitovich
    • 2
  • Christoph M. Wintersteiger
    • 3
  1. 1.Computing LaboratoryOxford UniversityUK
  2. 2.Formal Verification and Security GroupUniversity of LuganoSwitzerland
  3. 3.Computer Systems InstituteETH ZurichSwitzerland
  4. 4.School of Computer ScienceCarnegie Mellon UniversityUSA

Personalised recommendations