Symbolic implementation of the best transformer

Thomas Reps, Mooly Sagiv, Greta Yorsh

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 decision procedure, and obtains the best abstract value for a set of concrete stores that are represented symbolically, using a logical formula.

Original languageEnglish
Title of host publicationVerification, Model Checking, and Abstract Interpretation - 5th International Conference, VMCAI 2004, Proceedings
EditorsBernhard Steffen, Giorgio Levi
PublisherSpringer Verlag
Pages252-266
Number of pages15
ISBN (Print)9783540208037
DOIs
StatePublished - 2004
Event5th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2004 - Venice, Italy
Duration: 11 Jan 200413 Jan 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2937
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2004
Country/TerritoryItaly
CityVenice
Period11/01/0413/01/04

Fingerprint

Dive into the research topics of 'Symbolic implementation of the best transformer'. Together they form a unique fingerprint.

Cite this