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

DOI10.1007/3-540-61739-6_38zbMath1482.68074OpenAlexW1492397127MaRDI QIDQ5030191

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

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

logic programmingabstract interpretationabstract domaindomain relationreference variable

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (3)

Pair-independence and freeness analysis through linear refinement. ⋮ PAN: A portable, parallel Prolog: Its design, realisation and performance. ⋮ Set-sharing is redundant for pair-sharing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computer science today. Recent trends and developments
• Generalized semantics and abstract interpretation for constraint logic programs
• Analyzing logic programs using “prop”-ositional logic programs and a magic wand
• An Efficient Unification Algorithm
• Abstract interpretation and application to logic programs
• Static analysis of logic programs for independent and parallelism

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