Loop Summarization Using Abstract Transformers

  title={Loop Summarization Using Abstract Transformers},
  author={Daniel Kroening and Natasha Sharygina and Stefano Tonetta and Aliaksei Tsitovich and Christoph M. Wintersteiger},
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… CONTINUE READING
Highly Cited
This paper has 43 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…