Optimal multibinding unification for sharing and linearity analysis. Issue 3 (May 2014)

• Record Type: Journal Article
• Authors: AMATO, GIANLUCA; SCOZZARI, FRANCESCA
• Is Part Of: Theory and practice of logic programming. Volume 14:Issue 3(2014)
• Page Start: 379
• Page End: 400
• Publication Date: 2014-05
• Subjects: Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068413000070
• Languages: English
• ISSNs: 1471-0684

Abstract

<abstract abstract-type="normal"> <title>Abstract</title> <p>In the analysis of logic programs, abstract domains for detecting sharing properties are widely used. Recently, the new domain <inline-formula><alternatives><inline-graphic xlink:href="ark:/27927/pgg5h7x0wnb" xlink:type="simple" xmlns:xlink="http://www.w3.org/1999/xlink" /><tex-math><![CDATA[${\mathtt{ShLin}^{\omega}}$]]></tex-math></alternatives></inline-formula> 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.</p> </abstract>