Reproduce “Optimal matching for sharing and linearity analysis” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Gianluca Amato, Francesca Scozzari
Research from the University of Chieti–Pescara introduces and formally proves the optimality of abstract matching operators for the ShLin_omega, ShLin_2, and Sharing Lin domains. These operators enhance precision in goal-dependent static analysis of logic programs, accurately inferring properties like non-sharing and groundness that are not detectable by standard abstract unification.
Key insights
- The 'completeness on the second argument' lemma provides a rigorous method for proving the optimality of complex abstract operators like matching.
- Galois connections serve as a powerful theoretical tool for deriving optimal abstract operators for coarser domains from a more precise base domain.
- Achieving optimality in abstract operators for sharing analysis can, counter-intuitively, lead to simpler abstract objects, potentially improving analysis efficiency.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.