P. M. Hill, R. Bagnara, E. Za#anella, Soundness, idempotence and commutativity of set-sharing, Theory and Practice of Logic Programming 2 (2) (2002) 155--201. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Finite-Tree Analysis for Constraint Logic-Based.. - Bagnara, Gori, Hill, .. (2001) (1 citation) Self-citation (Hill Bagnara) (Correct)
No context found.
P. M. Hill, R. Bagnara, E. Za#anella, Soundness, idempotence and commutativity of set-sharing, Theory and Practice of Logic Programming 2 (2) (2002) 155--201.
Finite-Tree Analysis for Constraint Logic-Based Languages - Bagnara, Gori, Hill.. (2001) (1 citation) Self-citation (Hill Bagnara) (Correct)
No context found.
P. M. Hill, R. Bagnara, E. Za#anella, Soundness, idempotence and commutativity of set-sharing, Theory and Practice of Logic Programming 2 (2) (2002) 155--201.
Finite-Tree Analysis for Constraint Logic-Based Languages - Bagnara, Gori, Hill.. (2001) (1 citation) Self-citation (Hill Bagnara) (Correct)
No context found.
P. M. Hill, R. Bagnara, E. Za#anella, Soundness, idempotence and commutativity of set-sharing, Theory and Practice of Logic Programming 2 (2) (2002) 155--201.
Finite-Tree Analysis for Constraint Logic-Based.. - Bagnara, Gori, Hill, .. (2001) (1 citation) Self-citation (Hill Bagnara) (Correct)
No context found.
P. M. Hill, R. Bagnara, E. Za#anella, Soundness, idempotence and commutativity of set-sharing, Theory and Practice of Logic Programming 2 (2) (2002) 155--201.
A Correct, Precise and Efficient Integration of Set-Sharing.. - Hill, al. (2001) Self-citation (Hill Bagnara Zaffanella Set-sharing) (Correct)
....between sharing and linearity. As a matter of fact, we provide an example showing that all previous approaches to the combination of set sharing with freeness and linearity are not uniformly more precise than the analysis based on the ASub domain [11, 30, 36] By extending the results of [24] to this combination, we provide a new ab straction function that can be applied to any logic language computing on domains of syntactic structures, with or without the occurs check; by using this abstraction function, we also prove the correctness of the new abstract unification procedure. ....
....a m RSubst, as a m can map domain variables to infinite rational terms. This poses a non trivial problem when trying to define good abstraction functions, since it would be really desirable for this function to map any two equivalent concrete elements to the same abstract element. As shown in [24], the classical abstraction function for set sharing analysis [16, 26] which was defined for idempotent substitutions only, does not enjoy this property when applied, as it is, to arbitrary substitutions in rational solved form. A possibility is to look for a more general abstraction function ....
[Article contains additional citation context not shown here]
P.M. Hill, R. Bagnara, and E. Zaffanella. Soundness, idempotence and commutativity of set-sharing. Theory and Practice of Logic Programming, 2(2):155-201, 2002.
An Efficient and Precise Finite-Tree Analysis for.. - Bagnara, Zaffanella, .. Self-citation (Hill Bagnara) (Correct)
....These are the motivations behind the introduction of the following computable operators on substitutions. The groundness operator gvars captures the set of variables that are mapped to ground rational trees by rt. We define it by means of the occurrence operator occ . This was introduced in [40] as a replacement for the sharing group operator sg of [44] In [40] the occ operator is used to define a new abstraction function for set sharing analysis that, di#erently from the classical ones [22, 44] maps equivalent substitutions in rational solved form to the same abstract element. ....
....computable operators on substitutions. The groundness operator gvars captures the set of variables that are mapped to ground rational trees by rt. We define it by means of the occurrence operator occ . This was introduced in [40] as a replacement for the sharing group operator sg of [44] In [40] the occ operator is used to define a new abstraction function for set sharing analysis that, di#erently from the classical ones [22, 44] maps equivalent substitutions in rational solved form to the same abstract element. Definition 9. Occurrence and groundness operators. For each n N, the ....
[Article contains additional citation context not shown here]
P. M. Hill, R. Bagnara, and E. Za#anella. Soundness, idempotence and commutativity of set-sharing. Theory and Practice of Logic Programming, 2(2):155-- 201,
A Correct, Precise and Efficient Integration of.. - Hill, Zaffanella.. (2001) Self-citation (Hill Bagnara) (Correct)
....between sharing and linearity. As a matter of fact, we provide an example showing that all previous approaches to the combination of set sharing with freeness and linearity are not uniformly more precise than the analysis based on the ASub domain [11, 28, 34] By extending the results of [22] to this combination, we provide a new abstraction function that can be applied to any logic language computing on domains of syntactic structures, with or without the occurs check; by using this abstraction function, we also prove the correctness of the new abstract unification procedure. ....
.... # RSubst, as # # can map domain variables to infinite rational terms. This poses a non trivial problem when trying to define good abstraction functions, since it would be really desirable for this function to map any two equivalent concrete elements to the same abstract element. As shown in [22], the classical abstraction function for set sharing analysis [16, 24] which was 2 As usual, this is modulo the possible renaming of variables. 9 defined for idempotent substitutions only, does not enjoy this property when applied, as it is, to arbitrary substitutions in rational solved form. ....
[Article contains additional citation context not shown here]
P. M. Hill, R. Bagnara, and E. Za#anella. Soundness, idempotence and commutativity of set-sharing. Theory and Practice of Logic Programming, 2(2):155--201,
Semantic-Based Software Support for Constraint Logic Programs - Hill (Correct)
No context found.
P. M. Hill, R. Bagnara, and E. Za anella. Soundness, Idempotence and Commutativity of Set-Sharing. Theory and Practice of Logic Programming, 2(2):155-201, March 2002.
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