Computer Sciences Dept.

Symbolic Implementation of the Best Transformer

Thomas Reps, Mooly Sagiv, Greta Yorsh

This paper shows how to achieve, under certain conditions, abstract-interpretation algorithms that enjoy the best possible precision for a given abstraction. The key idea is a simple process of successive approximation that makes repeated calls to a theorem prover, and obtains the best abstract value for a set of concrete stores that are represented symbolically, using a logical formula.

Download this report (PDF)

Return to tech report index

Computer Science | UW Home