Show full item record

File(s):

Author(s)

Reps, Thomas; Sagiv, Mooly; Yorsh, Greta

Publisher

University of Wisconsin-Madison Department of Computer Sciences

Date

Mar 15, 2012

Abstract

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/60334 

Export

Export to RefWorks 

Part of

CS Technical Reports

Show full item record