Lazy Set-Sharing Analysis

DOI10.1007/11737414_13MaRDI QIDQ3434632zbMATH OpenOpenAlexFDO

Authors Xuan Li, Andy King, Lunjin Lu

Publication date 2 May 2007

Published in Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL https://kar.kent.ac.uk/37602/1/content.pdf

Mathematics Subject Classification ID

Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Set-sharing is redundant for pair-sharing
• An algebraic approach to sharing analysis of logic programs
• Pair-sharing over rational trees
• Three optimisations for sharing
• Enhanced sharing analysis techniques: a comprehensive evaluation

Cited in

(13)

• Non-strict independence-based program parallelization using sharing and freeness information
• Set-sharing is redundant for pair-sharing
• Lazy structure sharing for query optimization
• scientific article; zbMATH DE number 4013998 (Why is no real title available?)
• scientific article; zbMATH DE number 1222415 (Why is no real title available?)
• scientific article; zbMATH DE number 1487849 (Why is no real title available?)
• Enhanced sharing analysis techniques: a comprehensive evaluation
• An algebraic approach to sharing analysis of logic programs
• A type based sharing analysis for update avoidance and optimisation
• Functional and Logic Programming
• A type based sharing analysis for update avoidance and optimisation
• Negative Ternary Set-Sharing
• Parallel Logic Programming: A Sequel

This page was built for publication: Lazy Set-Sharing Analysis

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