Optimal multibinding unification for sharing and linearity analysis
From MaRDI portal
Abstract: In the analysis of logic programs, abstract domains for detecting sharing properties are widely used. Recently the new domain has been introduced to generalize both sharing and linearity information. This domain is endowed with an optimal abstract operator for single-binding unification. The authors claim that the repeated application of this operator is also optimal for multi-binding unification. This is the proof of such a claim.
Recommendations
Cites work
- Abstract Interpretation Frameworks
- Compile-time derivation of variable dependency using abstract interpretation
- Discovering invariants via simple component analysis
- Enhanced sharing analysis techniques: a comprehensive evaluation
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- On the algebraic structure of declarative programming languages
- On the interaction between sharing and linearity
- Optimality in goal-dependent analysis of Sharing
- Pair-independence and freeness analysis through linear refinement.
- Pair-sharing over rational trees
- Sharing is optimal
- Static analysis of logic programs for independent and parallelism
Cited in
(5)
This page was built for publication: Optimal multibinding unification for sharing and linearity analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418949)