The Boolean logic of set sharing analysis

DOI10.1007/BFB0056609MaRDI QIDQ4217938zbMATH OpenFDO

Authors Michael Codish, Harald Søndergaard

Publication date 11 November 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0056609

zbMATH Keywords

set-sharing analysis

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Set-sharing is redundant for pair-sharing
• An algebraic approach to sharing analysis of logic programs
• scientific article; zbMATH DE number 1692955
• Lazy Set-Sharing Analysis
• Two classes of Boolean functions for dependency analysis

Cited in

(5)

• Set-sharing is redundant for pair-sharing
• scientific article; zbMATH DE number 1692955 (Why is no real title available?)
• Soundness, idempotence and commutativity of set-sharing
• scientific article; zbMATH DE number 7450001 (Why is no real title available?)
• Functional and Logic Programming

This page was built for publication: The Boolean logic of set sharing analysis

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