Now showing items 1-2 of 2
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. ...
A Method for Symbolic Computation of Abstract Operations
In 1979, Cousot and Cousot gave a specification of the best (most-precise) abstract transformer possible for a given concrete transformer and a given abstract domain. Unfortunately, their specification does not lead to an ...