Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

VMCAI
2004
Springer

favoriteEmaildiscussreport

71views Software Engineering» more VMCAI 2004»

Symbolic Implementation of the Best Transformer

13 years 10 months ago

Symbolic Implementation of the Best Transformer

Download www.cs.wisc.edu

This paper shows how to achieve, under certain conditions, abstract-interpretation ms 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 proced obtains the best abstract value for a set of concrete stores that are represented symbolically, using a logical formula.

Thomas W. Reps, Shmuel Sagiv, Greta Yorsh

Real-time Traffic

Abstract-interpretation Ms | Certain Conditions | Software Engineering | Successive Approximation | VMCAI 2004 |

claim paper

Related Content

» TypeDependence Analysis and Program Transformation for Symbolic Execution

» A Prototypical SelfOptimizing Package for Parallel Implementation of Fast Signal Transform...

» Unlexicalised Hidden Variable Models of Split Dependency Grammars

» TransformationBased Verification Using Generalized Retiming

» String Transformation Learning

» Symbolic analysis of analog circuits with hard nonlinearity

» Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large S...

» Symbolic debugging of globally optimized behavioral specifications

» A BDDLike Implementation of an Automata Package

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	VMCAI
Authors	Thomas W. Reps, Shmuel Sagiv, Greta Yorsh

Comments (0)