16 citations · 37 across the 12 of their papers we have counts for
Showing cs.PLShow all
3 papers · 1 filter
cs.PL2024★ 1 cited
Optimal matching for sharing and linearity analysis
Gianluca Amato, Francesca Scozzari
Static analysis of logic programs by abstract interpretation requires designing abstract operators which mimic the concrete ones, such as unification, renaming and projection. In t…
cs.PL2015
Efficiently intertwining widening and narrowing
Gianluca Amato, Francesca Scozzari, Helmut Seidl +2
Non-trivial analysis problems require posets with infinite ascending and descending chains. In order to compute reasonably precise post-fixpoints of the resulting systems of equati…
cs.PL2013★ 5 cited
Optimal multi-binding unification for sharing and linearity analysis
Gianluca Amato, Francesca Scozzari
In the analysis of logic programs, abstract domains for detecting sharing properties are widely used. Recently the new domain $\Linp$ has been introduced to generalize both sharing…