A freeness and sharing analysis of logic programs based on a pre-interpretation

DOI10.1007/3-540-61739-6_38MaRDI QIDQ5030191zbMATH OpenOpenAlexFDO

Authors Maurice Bruynooghe, Bart Demoen, Dmitri Boulanger, Marc Denecker, Anne Mulkers

Publication date 16 February 2022

Published in Static Analysis (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/123456789/167003

zbMATH Keywords

abstract domainabstract interpretationdomain relationlogic programmingreference variable

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• On the design of a correct freeness analysis for logic programs
• scientific article; zbMATH DE number 4178750
• Abstract interpretation and application to logic programs
• Bottom-up abstract interpretation of logic programs
• scientific article; zbMATH DE number 1692904

Cites work

• Abstract interpretation and application to logic programs
• An Efficient Unification Algorithm
• Analyzing logic programs using “prop”-ositional logic programs and a magic wand
• Computer science today. Recent trends and developments
• Generalized semantics and abstract interpretation for constraint logic programs
• scientific article; zbMATH DE number 3890770 (Why is no real title available?)
• scientific article; zbMATH DE number 3978439 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• Static analysis of logic programs for independent and parallelism

Cited in

(4)

• Set-sharing is redundant for pair-sharing
• PAN: A portable, parallel Prolog: Its design, realisation and performance.
• Pair-independence and freeness analysis through linear refinement.
• On the design of a correct freeness analysis for logic programs

This page was built for publication: A freeness and sharing analysis of logic programs based on a pre-interpretation

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