Article contents
Optimal multibinding unification for sharing and linearity analysis
Published online by Cambridge University Press: 09 August 2013
Abstract
In the analysis of logic programs, abstract domains for detecting sharing properties are widely used. Recently, the new domain ${\mathtt{ShLin}^{\omega}}$ 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 multibinding unification. This is the proof of such a claim.
- Type
- Technical Notes
- Information
- Copyright
- Copyright © Cambridge University Press 2013
References
- 2
- Cited by