“Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
From MaRDI portal
Recommendations
- On collecting semantics for program analysis
- scientific article; zbMATH DE number 517024
- Parametrized semantics of logic programs -- a unifying framework
- Collecting Semantics under Predicate Abstraction in the K Framework
- A hierarchy of semantics for normal constraint logic programs
- scientific article; zbMATH DE number 2085279
- The expressive powers of the logic programming semantics
- Towards a Systematic Account of Different Semantics for Logic Programs
- Well-founded and stable semantics of logic programs with aggregates
- scientific article; zbMATH DE number 176721
Cited in
(14)- Abstract interpretation of resolution-based semantics
- Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
- The reduced relative power operation on abstract domains
- Logical optimality of groundness analysis
- An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
- A theory of observables for logic programs
- On collecting semantics for program analysis
- Complementing logic program semantics
- scientific article; zbMATH DE number 1231565 (Why is no real title available?)
- Refining and compressing abstract domains
- Collecting Semantics under Predicate Abstraction in the K Framework
- Computing abstract distances in logic programs
- Transforming semantics by abstract interpretation
- Integrating ADTs in KeY and their application to history-based reasoning about collection
This page was built for publication: “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593956)
