Show simple item record

dc.contributor.authorReps, Thomas
dc.contributor.authorElder, Matt
dc.contributor.authorThakur, Aditya
dc.date.accessioned2012-04-02T19:16:05Z
dc.date.available2012-04-02T19:16:05Z
dc.date.issued2012-03-28
dc.identifier.citationTR1713
dc.identifier.urihttp://digital.library.wisc.edu/1793/60977
dc.description.abstractGiven a concrete domain C, a concrete operation tau: C -> C, and an abstract domain A, a fundamental problem in abstract interpretation is to find the best abstract transformer tau#: A -> A that over-approximates tau. This problem, as well as several other operations needed by an abstract interpreter, can be reduced to the problem of symbolic bstraction: the symbolic abstraction of a formula phi in logic L, denoted by alphaHat(phi), is the best value in A that over-approximates the meaning of phi. When the concrete semantics of tau is defined in L using a formula psi that specifies the relation between input and output states, the best abstract transformer tau# can be computed as alphaHat(psi). In this paper, we present a new framework for performing symbolic abstraction, discuss its properties, and present several instantiations for various logics and abstract domains. The key innovation is to use a bilateral successive-approximation algorithm, which maintains both an over-approximation and an under-approximation of the desired answer. The advantage of having a non-trivial over-approximation is that it makes the technique resilient to timeouts.en
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciences
dc.subjectbest transformeren
dc.subjectsymbolic abstractionen
dc.subjectabstract interpretationen
dc.titleBilateral Algorithms for Symbolic Abstractionen
dc.typeTechnical Reporten


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • CS Technical Reports
    Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record