Skip to main content
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 4
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    AMATO, GIANLUCA and SCOZZARI, FRANCESCA 2010. On the interaction between sharing and linearity. Theory and Practice of Logic Programming, Vol. 10, Issue. 01, p. 49.

    AMATO, GIANLUCA and SCOZZARI, FRANCESCA 2009. Optimality in goal-dependent analysis of Sharing. Theory and Practice of Logic Programming, Vol. 9, Issue. 05, p. 617.

    Gras, Daniel Cabeza and Hermenegildo, Manuel V. 2009. Non-strict independence-based program parallelization using sharing and freeness information. Theoretical Computer Science, Vol. 410, Issue. 46, p. 4704.

    Bagnara, Roberto Gori, Roberta Hill, Patricia M. and Zaffanella, Enea 2004. Finite-tree analysis for constraint logic-based languages. Information and Computation, Vol. 193, Issue. 2, p. 84.

  • Theory and Practice of Logic Programming, Volume 4, Issue 3
  • May 2004, pp. 289-323

A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages

  • DOI:
  • Published online: 01 May 2004

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. (2000) and 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.

Hide All
This work has been funded by MURST projects “Automatic Program Certification by Abstract Interpretation”, “Abstract Interpretation, type systems and control-flow analysis”, and “Automatic Aggregate- and Number-Reasoning for Computing: from Decision Algorithms to Constraint Programming with Multisets, Sets, and Maps”; by the Integrated Action Italy-Spain “Advanced Development Environments for Logic Programs”; by the University of Parma's FIL scientific research project (ex 60%) “Pure and applied mathematics”; and by the UK's Engineering and Physical Sciences Research Council (EPSRC) under grant M05645.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *