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

DOI10.1017/S1471068403001868MaRDI QIDQ4669646zbMATH OpenOpenAlexWikidataFDO

Authors Patricia M. Hill, Enea Zaffanella, Roberto Bagnara

Publication date 15 April 2005

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s1471068403001868

zbMATH Keywords

logic programmingabstract unification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic programming (68N17)

Recommendations

• On the design of a correct freeness analysis for logic programs
• On the interaction between sharing and linearity
• Pair-sharing over rational trees
• Three optimisations for sharing
• Finite-tree analysis for constraint logic-based languages

Cited in

(6)

• On the interaction between sharing and linearity
• Non-strict independence-based program parallelization using sharing and freeness information
• Negative Ternary Set-Sharing
• scientific article; zbMATH DE number 1832223 (Why is no real title available?)
• Finite-tree analysis for constraint logic-based languages
• Optimality in goal-dependent analysis of Sharing

This page was built for publication: A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4669646)