Symbolic Implementation of the Best Transformer
File(s)
Date
2003Author
Reps, Thomas
Sagiv, Mooly
Yorsh, Greta
Publisher
University of Wisconsin-Madison Department of Computer Sciences
Metadata
Show full item recordAbstract
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.
Permanent Link
http://digital.library.wisc.edu/1793/60334Citation
TR1468