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

DOI10.1017/S1471068403001868zbMath1088.68027OpenAlexW2141598841WikidataQ60501149 ScholiaQ60501149MaRDI QIDQ4669646

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)

Related Items

Optimality in goal-dependent analysis of Sharing, On the interaction between sharing and linearity, Non-strict independence-based program parallelization using sharing and freeness information, Negative Ternary Set-Sharing, Finite-tree analysis for constraint logic-based languages