Abstract compilation for sharing analysis

DOI10.1007/3-540-44716-4_20MaRDI QIDQ2763646zbMATH OpenFDO

Authors Gianluca Amato, Fausto Spoto

Publication date 21 January 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2024/20240311

zbMATH Keywords

abstract interpretationdomain theorylinear logiclinear refinementlogic programming

Mathematics Subject Classification ID

Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Logic programming (68N17)

Recommendations

• Pair-independence and freeness analysis through linear refinement.
• Abstract domains for sharing analysis by optimal semantics
• On the design of a correct freeness analysis for logic programs
• Optimality in goal-dependent analysis of Sharing
• Compile-time derivation of variable dependency using abstract interpretation

Cited in

(10)

• Pair-independence and freeness analysis through linear refinement.
• Abstract domains for sharing analysis by optimal semantics
• On the design of a correct freeness analysis for logic programs
• Optimality in goal-dependent analysis of Sharing
• Compile-time derivation of variable dependency using abstract interpretation
• Widening sharing
• Freeness analysis through linear refinement
• Sharing in typed module assembly language
• Enhanced sharing analysis techniques: a comprehensive evaluation
• A freeness and sharing analysis of logic programs based on a pre-interpretation

This page was built for publication: Abstract compilation for sharing analysis

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