Loop Summarization Using Abstract Transformers

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

Abstract

Existing program analysis tools that implement abstraction rely on saturating procedures to compute over-approximations of fixpoints. As an alternative, we propose a new algorithm to compute an over-approximation of the set of reachable states of a program by replacing loops in the control flow graph by their abstract transformer. Our technique is able to generate diagnostic information in case of property violations, which we call leaping counterexamples. We have implemented this technique and report experimental results on a set of large ANSI-C programs using abstract domains that focus on properties related to string-buffers.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Daniel Kroening
    • 1
  • Natasha Sharygina
    • 2
    • 5
  • Stefano Tonetta
    • 3
  • Aliaksei Tsitovich
    • 2
  • Christoph M. Wintersteiger
    • 4
  1. 1.Computing LaboratoryOxford UniversityUK
  2. 2.University of LuganoSwitzerland
  3. 3.Fondazione Bruno KesslerTrentoItaly
  4. 4.Computer Systems InstituteETH ZurichSwitzerland
  5. 5.School of Computer ScienceCarnegie Mellon UniversityUSA

Personalised recommendations