Abstract
AbstractIn the analysis of logic programs, abstract domains for detecting sharing and linearity information are widely used. Devising abstract unification algorithms for such domains has proved to be rather hard. At the moment, the available algorithms are correct but not optimal; i.e., they cannot fully exploit the information conveyed by the abstract domains. In this paper, we define a new (infinite) domainShLinωwhich can be thought of as a general framework from which other domains can be easily derived by abstraction.ShLinωmakes the interaction between sharing and linearity explicit. We provide a constructive characterization of the optimal abstract unification operator onShLinω, and we lift it to two well-known abstractions ofShLinω, namely, to the classicalSharing×Linabstract domain and to the more preciseShLin2abstract domain by Andy King. In the case of single-binding substitutions, we obtain optimal abstract unification algorithms for such domains.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
