Exploiting goal independence in the analysis of logic programs

DOI10.1016/S0743-1066(96)00143-4MaRDI QIDQ4365084zbMATH OpenOpenAlexFDO

Authors Michael Codish, Maurice Bruynooghe, Maria Garcia De La Banda, Manuel Hermenegildo

Publication date 16 March 1998

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0743-1066(96)00143-4

zbMATH Keywords

goal independent analysislogic programs

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Differential methods in logic program analysis
• Efficient goal directed bottom-up evaluation of logic programs
• Analyzing logic programs using “prop”-ositional logic programs and a magic wand
• Static analysis of logic programs for independent and parallelism
• Abstract interpretation of logic programs using magic transformations

Cited in

(6)

• Pair-independence and freeness analysis through linear refinement.
• scientific article; zbMATH DE number 1692896 (Why is no real title available?)
• Differential methods in logic program analysis
• scientific article; zbMATH DE number 1956547 (Why is no real title available?)
• Efficient goal directed bottom-up evaluation of logic programs
• Analysis and Transformation of Constrained Horn Clauses for Program Verification

This page was built for publication: Exploiting goal independence in the analysis of logic programs

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