Refining and compressing abstract domains

56Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the context of Cousot and Cousot’s abstract interpretation theory, we present a general framework to define, study and handle operators modifying abstract domains. In particular, we introduce the notions of operators of refinement and compression of abstract domains: A refinement enhances the precision of an abstract domain; a compression operator (compressor) can exist relatively to a given refinement, and it simplifies as much as possible a domain of input for that refinement. The adequateness of our framework is shown by the fact that most of the existing operators on abstract domains fall in it. A precise relationship of adjunction between refinements and compressors is also given, justifying why compressors can be understood as inverses of refinements.

Cite

CITATION STYLE

APA

Giacobazzi, R., & Ranzato, F. (1997). Refining and compressing abstract domains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1256, pp. 771–781). Springer Verlag. https://doi.org/10.1007/3-540-63165-8_230

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free