Search
Now showing items 1-6 of 6
A Method for Symbolic Computation
(2011-12)
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 ...
Abstract Domains of Affine Relations
(University of Wisconsin-Madison Department of Computer Sciences, 2013-05-13)
This paper considers some known abstract domains for affine-relation
analysis, along with several variants, and studies how they relate to
each other. The various domains represent sets of points that satisfy
affine ...
PostHat and All That: Attaining Most-Precise Inductive Invariants
(2013-04-16)
In abstract interpretation, the choice of an abstract domain fixes a
limit on the precision of the inductive invariants that one can
express; however, for a given abstract domain A, there is a
most-precise (``strongest'', ...
An Abstract Domain for Bit-Vector Inequalities
(University of Wisconsin-Madison Department of Computer Sciences, 2013-04-16)
This paper advances the state of the art in abstract interpretation of
machine code. It tackles two of the biggest challenges in machine-code
analysis: (1) holding onto invariants about values in memory, and
(2) identifying ...
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
(2012-02)
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 ...






