Abstract interpretation of resolution-based semantics
From MaRDI portal
Publication:1035705
DOI10.1016/j.tcs.2009.07.040zbMath1187.68307OpenAlexW2156720745MaRDI QIDQ1035705
Radhia Cousot, Roberto Giacobazzi, Patrick Cousot
Publication date: 4 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.040
Related Items (1)
Uses Software
Cites Work
- Fully abstract compositional semantics for an algebra of logic programs
- ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
- Declarative modeling of the operational behavior of logic languages
- Compositionality properties of SLD-derivations
- Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
- The reduced relative power operation on abstract domains
- A compositional semantics for logic programs
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
- A model-theoretic reconstruction of the operational semantics of logic programs
- Observable behaviors and equivalences of logic programs
- Oracle semantics for Prolog
- A lattice-theoretical fixpoint theorem and its applications
- Complementing logic program semantics
- Grammar Analysis and Parsing by Abstract Interpretation
- Operational and denotational semantics of prolog
- The Semantics of Predicate Logic as a Programming Language
- The s-semantics approach: Theory and applications
- “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
- Resultant semantics for prolog
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Abstract interpretation of resolution-based semantics
