Three optimisations for sharing

DOI10.1017/S1471068402001497zbMATH Open1105.68329MaRDI QIDQ4452604FDOQ4452604

Authors: Jacob M. Howe, Andy King 

Publication date: 1 March 2004

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

Recommendations

• Optimality in goal-dependent analysis of Sharing
• Three methods to share joint costs or surplus
• Sharing three values with small weights
• Optimal File Sharing in Distributed Networks
• Choosing and sharing
• scientific article; zbMATH DE number 1487849
• Weak optimality, and the meaning of sharing

zbMATH Keywords

freeness

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (6)

• On the interaction between sharing and linearity
• Lazy Set-Sharing Analysis
• A type based sharing analysis for update avoidance and optimisation
• A type based sharing analysis for update avoidance and optimisation
• A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages
• Optimality in goal-dependent analysis of Sharing

This page was built for publication: Three optimisations for sharing

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