Computer Science – Programming Languages
Scientific paper
2004-01-26
Computer Science
Programming Languages
35 pages, 1 table, to appear on "Theory and Practice of Logic Programming"
Scientific paper
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of logic programs to be improved. In this paper we present a novel combination of set-sharing with freeness and linearity information, which is characterized by an improved abstract unification operator. We provide a new abstraction function and prove the correctness of the analysis for both the finite tree and the rational tree cases. Moreover, we show that the same notion of redundant information as identified in (Bagnara et al. 2002; Zaffanella et al. 2002) also applies to this abstract domain combination: this allows for the implementation of an abstract unification operator running in polynomial time and achieving the same precision on all the considered observable properties.
Bagnara Roberto
Hill Patricia M.
Zaffanella Enea
No associations
LandOfFree
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-143167