Symbolic Implementation of the Best Transformer

Simple item page
dc.contributor.authorReps, Thomasen_US
dc.contributor.authorSagiv, Moolyen_US
dc.contributor.authorYorsh, Gretaen_US
dc.date.accessioned2012-03-15T17:16:50Z
dc.date.available2012-03-15T17:16:50Z
dc.date.created2003en_US
dc.date.issued2003
dc.description.abstractThis 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.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationTR1468en_US
dc.identifier.urihttp://digital.library.wisc.edu/1793/60334
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleSymbolic Implementation of the Best Transformeren_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR1468.pdf
Size:
1.87 MB
Format:
Adobe Portable Document Format
Download

Collections

CS Technical Reports