Optimality in goal-dependent analysis of Sharing

DOI10.1017/S1471068409990111zbMath1181.68095MaRDI QIDQ3181746

Gianluca Amato, Francesca Scozzari

Publication date: 12 October 2009

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

zbMATH Keywords

matchingunificationlogic programmingabstract interpretationsharingexistentially quantified substitutions

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (5)

Experimental evaluation of numerical domains for inferring ranges ⋮ The role of linearity in sharing analysis ⋮ Optimal multibinding unification for sharing and linearity analysis ⋮ Exploiting linearity in sharing analysis of object-oriented programs ⋮ On the interaction between sharing and linearity

Cites Work

• Unnamed Item
• The role of standardising apart in logic programming
• Set-sharing is redundant for pair-sharing
• Pair-independence and freeness analysis through linear refinement.
• Optimal groundness analysis using propositional logic
• Abstract interpretation and application to logic programs
• Static analysis of logic programs for independent and parallelism
• Compile-time derivation of variable dependency using abstract interpretation
• The Semantics of Predicate Logic as a Programming Language
• Differential methods in logic program analysis
• Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions
• Three optimisations for sharing
• Pair-sharing over rational trees
• A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages
• Enhanced sharing analysis techniques: a comprehensive evaluation
• Sharing is optimal
• An algebraic approach to sharing analysis of logic programs
• Making abstract interpretations complete
• A practical framework for theabstract interpretation of logic programs

This page was built for publication: Optimality in goal-dependent analysis of Sharing