“Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
From MaRDI portal
Publication:4593956
DOI10.1007/3-540-60922-9_41zbMath1379.68065OpenAlexW1488938716MaRDI QIDQ4593956
Publication date: 16 November 2017
Published in: STACS 96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60922-9_41
Related Items (9)
Refining and compressing abstract domains ⋮ On collecting semantics for program analysis ⋮ Transforming semantics by abstract interpretation ⋮ Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements ⋮ Abstract interpretation of resolution-based semantics ⋮ The reduced relative power operation on abstract domains ⋮ An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. ⋮ A theory of observables for logic programs ⋮ Logical optimality of groundness analysis
This page was built for publication: “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics