Download PDFOpen PDF in browser

Loopfrog — loop summarization for static analysis

2 pagesPublished: June 22, 2012


Loopfrog is a scalable static analyzer for ANSI-C programs, that combines the precision of model checking and the performance of abstract interpretation. In contrast to traditional static analyzers, it does not calculate the abstract fix-point of a program by iterative application of an abstract transformer. Instead, it calculates symbolic abstract transformers for program fragments (e.g., loops) using a loop summarization algorithm. Loopfrog computes abstract transformers starting from the inner-most loops, which results in linear (in the number of the looping constructs) run-time of the sum- marization procedure and which is often considerably smaller than the traditional saturation procedure of abstract interpetation. It also provides “leaping” counterexamples to aid in the diagnosis of errors.

Keyphrases: loop invariants, loop summarization, Loopfrog, static analysis

In: Andrei Voronkov, Laura Kovács and Nikolaj Bjorner (editors). WING 2010. Workshop on Invariant Generation 2010, vol 1, pages 130--131

BibTeX entry
  author    = {Daniel Kroening and Natasha Sharygina and Stefano Tonetta and Aliaksei Tsitovich and Christoph M. Wintersteiger},
  title     = {Loopfrog -- loop summarization for static analysis},
  booktitle = {WING 2010. Workshop on Invariant Generation 2010},
  editor    = {Andrei Voronkov and Laura Kovacs and Nikolaj Bjorner},
  series    = {EPiC Series in Computing},
  volume    = {1},
  pages     = {130--131},
  year      = {2012},
  publisher = {EasyChair},
  bibsource = {EasyChair,},
  issn      = {2398-7340},
  url       = {},
  doi       = {10.29007/g3fd}}
Download PDFOpen PDF in browser