About This Item

Ask the MINDS@UW Librarian

Symbolic Implementation of the Best Transformer

Show full item record

File(s):

Author(s)
Reps, Thomas; Sagiv, Mooly; Yorsh, Greta
Publisher
University of Wisconsin-Madison Department of Computer Sciences
Citation
TR1468
Date
2003
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

Show full item record

Search and browse




About MINDS@UW

Deposit materials

  1. Register to deposit in MINDS@UW
  2. Need deposit privileges? Contact us.
  3. Already registered? Have deposit privileges? Deposit materials.