Optimal multi-binding unification for sharing and linearity analysis
GIANLUCA AMATO and FRANCESCA SCOZZARI
Dipartimento di Economia, Universita di Chieti-Pescara
Abstract
In the analysis of logic programs, abstract domains for detecting sharing properties are widely used. Recently the new domain 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 multi-binding unification. This is the proof of such a claim.
Bibtex (Use it for references)
@article{KEYWORD,
journal = {Theory and Practice of Logic Programming},
publisher = {Cambridge University Press},
author = {GIANLUCA AMATO and FRANCESCA SCOZZARI}},
title = {Optimal multi-binding unification for sharing and linearity analysis},
journal = {TPLP},
volume = {14},
number = {3},
year = {2014},
pages = {379-400}
}
CoRR: Full Text