M. Codish, D. Dams, G. Fil'e, and M. Bruynooghe. On the design of a correct freeness analysis for logic programs. Journal of Logic Programming, 28(3):181-- 206, September 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... from a bi directional interaction between aliasing and freeness information was initially pointed out by Muthukumar and Hermenegildo [32, 33] Since then, several authors considered the integration of set sharing with freeness, sometimes also including additional explicit structural information [9, 10, 29, 18]. Building on the results obtained in [34] 11] and [32] but independently from [30] Hans and Winkler [20] proposed a combined integration of freeness and linearity information with set sharing. Similar combinations have been proposed in [5, 6, 7] From a more pragmatic point of view, Codish et ....

M. Codish, D. Dams, G. File, and M. Bruynooghe. On the design of a correct freeness analysis for logic programs. Journal of Logic Programming, 28(3):181--206, 1996. 20

....the sharing behavior of variables and this is now a standard choice for sharing analysis. Subsequent research then concentrated mainly on extending the domain to incorporate additional properties such as linearity, freeness and depth k abstractions (Langen 1990, Bruynooghe and Codish 1993, Codish, Dams, File and Bruynooghe 1996, King 1994, King and Soper 1994, Muthukumar and Hermenegildo 1992) or in reducing its complexity (Bagnara, Hill and Za#anella 1997, Bagnara, Hill and Zaffanella 2001) Key properties such as commutativity and soundness of this domain and its associated abstract operations such as abstract ....

Codish, M., Dams, D., File, G. and Bruynooghe, M. (1996). On the design of a correct freeness analysis for logic programs, Journal of Logic Programming 28(3): 181--206.

....the sharing behavior of variables and this is now a standard choice for sharing analysis. Subsequent research then concentrated mainly on extending the domain to incorporate additional properties such as linearity, freeness and depth k abstractions (Langen 1990, Bruynooghe and Codish 1993, Codish, Dams, Fil e and Bruynooghe 1996, King 1994, King and Soper 1994, Muthukumar and Hermenegildo 1992) or in reducing its complexity (Bagnara, Hill and Za anella 1997, Bagnara, Hill and Zaffanella 2001) Key properties such as commutativity and soundness of this domain and its associated abstract operations such as abstract uni ....

Codish, M., Dams, D., File, G. and Bruynooghe, M. (1996). On the design of a correct freeness analysis for logic programs, Journal of Logic Programming 28(3): 181-206.

....allows the de nition of an abstract uni cation operation which is imprecise but still useful. The second approach abstracts a substitution into an abstract set of equations, which can be seen as an approximate description of the concrete set of equations represented by the substitution itself [3, 4, 5, 19, 23]. This means that part of the functor structure of the substitution is maintained in the abstract sets of equations, resulting in an extremely precise analysis but with rather complex abstract operations. In [15] an intermediate approach is proposed. Here the terms are fully abstracted apart from ....

M. Codish, D. Dams, G. File, and M. Bruynooghe. On the Design of a Correct Freeness Analysis for Logic Programs. Journal of Logic Programming, 28(3):181{ 206, September 1996.

No context found.

M. Codish, D. Dams, G. Fil'e, and M. Bruynooghe. On the design of a correct freeness analysis for logic programs. Journal of Logic Programming, 28(3):181-- 206, September 1996.

.... from a bi directional interaction between aliasing and freeness information was initially pointed out by Muthukumar and Her menegildo [34, 35] Since then, several authors considered the integration of set sharing with freeness, sometimes also including additional explicit structural information [9, 10, 31, 20]. Building on the results obtained in [36] 11] and [34] but independently from [32] Hans and Winklet [22] proposed a combined integration of freehess and linearity information with set sharing. Similar combinations have been proposed in [5, 6, 7] From a more pragmatic point of view, Codish ....

M. Codish, D. Dams, G. Fil6, and M. Bruynooghe. On the design of a correct freeness analysis for logic programs. Journal of Logic Programming, 28(3) :181-206, 1996.

....compilation scheme for sharing information. 2) Most of the recent work on sharing analyses for logic programs attempts to justify the correctness of the proposed abstract operations (e.g. unification) by mimicking the behavior of a suitable corresponding concrete algorithm (for example as in [5, 6]) In contrast, in this paper we focus on algebraic properties (e.g. of a most general unifier) For example, we first characterize the algebraic properties of an abstract most general unifier in the context of a sharing analysis, and then provide an abstract unification algorithm and prove that ....

....; X n ] Y s; X 1 ; X n jY s] in which the variable sharing of the last argument with the first and with the second is evident. 8 Sharing Analysis with Linearity Traditionally, aliasing and groundness analyses are enhanced with other kinds of information such as linearity and freeness [4, 5, 13, 27, 3] which are useful in their own right and can significantly improve the set sharing information obtained. In [11] the authors demonstrate that linearity information improves the precision of set sharing analyses and reduces the cost of its computation. The following example illustrates this point. ....

M. Codish, D. Dams, G. Fil'e, and M. Bruynooghe. On the design of a correct freeness analysis for logic programs. Journal of Logic Programming, 28(3):181-- 206, September 1996.

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