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 decision procedure, and obtains the best abstract value for a set of concrete stores that are represented symbolically, using a logical formula.
CITATION STYLE
Reps, T., Sagiv, M., Yorsh, G., Steffen, B., & Levi, G. (2004). Verification, Model Checking, and Abstract Interpretation (Vol. 2937, pp. 3–25). Retrieved from http://www.springerlink.com/content/784lhmrl1rlbpjln/
Mendeley helps you to discover research relevant for your work.