Loop Summarization using Abstract Transformers

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.

• BibTex

@inproceedings { ksttw2008,
	title = { Loop Summarization using Abstract Transformers},
	booktitle = {6th International Symposium on Automated Technology for Verification and Analysis (ATVA)},
	volume = {5311},
	year = {2008},
	pages = {111-125},
	publisher = { Springer},
	organization = { Springer},
	type = {inproceedings},
	address = {Seoul, South Korea},
	URL = {http://dx.doi.org/10.1007/978-3-540-88387-6_10},
	author = { Kroening, Daniel  and   Sharygina, Natasha  and   Tonetta, Stefano  and   Tsitovich, Aliaksei  and   Wintersteiger, Christoph M.}
}