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 Linp 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.











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)