François Bourdoncle, Abstract interpretation by dynamic partitioning

François Bourdoncle, Abstract interpretation by dynamic partitioning

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: PARIS RESEARCH LABORATORY d i g i t a l March 1992 18 Francois Bourdoncle Abstract Interpretation by Dynamic Partitioning 18 Abstract Interpretation by Dynamic Partitioning Francois Bourdoncle March 1992 Publication Notes This paper has also been published in the Journal of Functional Programming. c Digital Equipment Corporation 1992 This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for non-profit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of the Paris Research Laboratory of Digital Equipment Centre Technique Europe, in Rueil-Malmaison, France; an acknowledgement of the authors and individual contributors to the work; and all applicable portions of the copyright notice. Copying, reproducing, or republishing for any other purpose shall require a license with payment of fee to the Paris Research Laboratory. All rights reserved. ii Abstract The essential part of abstract interpretation is to build a machine-representable abstract domain expressing interesting properties about the possible states reached by a program at run-time. Many techniques have been developed which assume that one knows in advance the class of properties that are of interest. There are cases however when there are no a priori indications about the best abstract properties to use. We introduce a new framework that enables non- unique representations of abstract program properties to be used, and expose a method, called dynamic partitioning, that allows the dynamic determination of interesting abstract domains using data structures built over simpler domains. Finally, we show how dynamic partitioning can be used to compute non-trivial approximations of functions over infinite domains and give an application to the computation of minimal function graphs. Resume Lune des principales difficultes de linterpretation abstraite consiste `a construire un domaine abstrait, representable en machine, qui permette dexprimer un ensemble de proprietes suffisant `a decrire de mani`ere precise lensemble des etats dans lequel peut se trouver un programme lorsquil est execute. De nombreuse techniques dinterpretation abstraite ont ete developpees `a partir de lhypoth`ese que la classe des bonnes proprietes est, d`es le depart, bien identifiee. Cependant, dans de nombreux cas, il ny a aucune indication a priori quant `a linteret relatif des differentes classes de proprietes envisageables. Nous presentons ici une nouvelle methode, appelee partitionnement dynamique, qui autorise la determination dynamique des bonnes proprietes par lutilisationde structures de donnee construites `a partir dapproximations simples du domaine concret. Nous montrons en particulier comment des approximations finies et nondu domaine concret....
View Full Document

This note was uploaded on 04/18/2011 for the course COMPUTER S 1111 taught by Professor Name during the Spring '05 term at MIT.

Page1 / 42

François Bourdoncle, Abstract interpretation by dynamic partitioning

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online