Optimal multibinding unification for sharing and linearity analysis

DOI10.1017/S1471068413000070zbMath1311.68041arXiv1306.2291MaRDI QIDQ5418949

Gianluca Amato, Francesca Scozzari

Publication date: 30 May 2014

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

Full work available at URL: https://arxiv.org/abs/1306.2291

zbMATH Keywords

unificationstatic analysislinearityabstract interpretationsharing

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (2)

The role of linearity in sharing analysis ⋮ Exploiting linearity in sharing analysis of object-oriented programs

Cites Work

• Unnamed Item
• Discovering invariants via simple component analysis
• On the algebraic structure of declarative programming languages
• Pair-independence and freeness analysis through linear refinement.
• Optimality in goal-dependent analysis of Sharing
• On the interaction between sharing and linearity
• Static analysis of logic programs for independent and parallelism
• Compile-time derivation of variable dependency using abstract interpretation
• Pair-sharing over rational trees
• Enhanced sharing analysis techniques: a comprehensive evaluation
• Sharing is optimal
• Abstract Interpretation Frameworks

This page was built for publication: Optimal multibinding unification for sharing and linearity analysis