Anne Mulkers. Deriving Live Data Structures in Logic Programs by Means of Abstract Interpretation. PhD thesis, Katholieke Universitiet of Leuven, Belgium, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....b i are arbitrary coe#cients. With an adequate choice of the b i , a linear combination can be obtained such that each X i becomes possibly non free. Making the distinction between new and old information in the analysis of logic programs is applied previously by Plaisted [25] and also by Mulkers [22, 23]. An implementation Our analysis has been implemented within the abstract interpretation framework of Bruynooghe [1] As an example, we show the results obtained for the sumlist 2 program with an initial call pattern sumlist(a, f ) indicating that the first argument is any term and the second ....

A. Mulkers. Deriving Live Data Structures in Logic Programs by Means of Abstract Interpretation. Ph.D. thesis, Department of Computer Science, Katholieke Universiteit Leuven, Dec. 1991.

....FunP [ fORgg 2 Nodes : Desc(n) fn 0 j (n; n 0 ) 2 ForArcs [ BackArcsg. A rigid type graph T describes a (possibly in nite) set of nite terms. This set of nite terms is found by means of the denotation function, ID. The next couple of de nitions were inspired by similar de nitions in [Mulkers 1993]. De nition 6.21 (adapted from [Mulkers 1993] de nition 2.3.2) Let Tbe the function T: Nodes 2 (Nodes TermP ) 2 TermP : if Label(n) 2 ConstP then T(n; I) fLabel(n)g if Label(n) 2 P then T(n; I) Denote(Label(n) if Label(n) Max then T(n; I) TermP if Label(n) OR then T(n; I) ....

....(n; n 0 ) 2 ForArcs [ BackArcsg. A rigid type graph T describes a (possibly in nite) set of nite terms. This set of nite terms is found by means of the denotation function, ID. The next couple of de nitions were inspired by similar de nitions in [Mulkers 1993] De nition 6. 21 (adapted from [Mulkers 1993]: de nition 2.3.2) Let Tbe the function T: Nodes 2 (Nodes TermP ) 2 TermP : if Label(n) 2 ConstP then T(n; I) fLabel(n)g if Label(n) 2 P then T(n; I) Denote(Label(n) if Label(n) Max then T(n; I) TermP if Label(n) OR then T(n; I) S n 0 2Desc(n) ft j (n 0 ; t) 2 Ig ....

[Article contains additional citation context not shown here]

Mulkers, A. 1993. Deriving Live Data Structures in Logic Programs by means of Abstract Interpretation.

....has been fully developed and described in [ 9 ] 3) the tools for inferring them are available at our site, allowing for extensive experiments with the proposed techniques. Due to space restrictions and since rigid types are not part of the contribution of this paper, we refer to [ 9 ] and [ 12 ] for the underlying intuitions. Here, we only recall the basic definitions and give an example. There exist a number of primitive types (e.g. INT, REAL) which represent subsets of the set of constants in the language. We denote the set of all primitive types by P , and we 3 assume that there ....

....Definition 2.2 Desc : fn 2 Nodes j Label(n) 2 Fun P [ fORgg 2 Nodes : Desc(n) fn 0 j (n; n 0 ) 2 ForArcs [ BackArcsg. A rigid type graph T describes a (possibly infinite) set of finite terms. This set of finite terms is found by means of the denotation function, ID. We refer to ( [ 12 ] , Def. 2.3.4 and following) for formal definition. In [ 7 ] the function TypeLabel was introduced to regard a rigid type graph as a specification of a set of rigid types : every node in the type graph can be considered as the root of a new type graph, defined by the subgraph rooted at that ....

A. Mulkers. Deriving Live Data Structures in Logic Programs by means of Abstract Interpretation. Number 675 in LNCS. Springer-Verlag, 1993. 19

No context found.

Anne Mulkers. Deriving Live Data Structures in Logic Programs by Means of Abstract Interpretation. PhD thesis, Katholieke Universitiet of Leuven, Belgium, 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC