Optimal matching for sharing and linearity analysis

Static analysis of logic programs by abstract interpretation requires designing abstract operators which mimic the concrete ones, such as unification, renaming and projection. In the case of goal-driven analysis, where goal-dependent semantics are used, we also need a backward-unification operator, typically implemented through matching. In this paper we study the problem of deriving optimal abstract matching operators for sharing and linearity properties. We provide an optimal operator for matching in the domain ${\mathtt{S}\mathtt{h}\mathtt{L}\mathtt{i}\mathtt{n}}^{\omega }$, which can be easily instantiated to derive optimal operators for the domains ${\mathtt{S}\mathtt{h}\mathtt{L}\mathtt{i}\mathtt{n}}^2$ by Andy King and the reduced product $\mathtt{S}\mathtt{h}\mathtt{a}\mathtt{r}\mathtt{i}\mathtt{n}\mathtt{g}\times \mathtt{L}\mathtt{i}\mathtt{n}$.