Now showing items 1-1 of 1
Bilateral Algorithms for Symbolic Abstraction
(University of Wisconsin-Madison Department of Computer Sciences, 2012-03-28)
Given 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. ...