The s-semantics approach: Theory and applications

DOI10.1016/0743-1066(94)90026-4zbMath0942.68527OpenAlexW2055807110MaRDI QIDQ4305626

Maurizio Martelli, Maurizio Gabbrielli, Annalisa Bossi, Giorgio Levi

Publication date: 14 August 2000

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(94)90026-4

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items

Pair-independence and freeness analysis through linear refinement. ⋮ Deriving escape analysis by abstract interpretation ⋮ An integrated framework for the diagnosis and correction of rule-based programs ⋮ A new generic scheme for functional logic programming with constraints ⋮ On collecting semantics for program analysis ⋮ Inference of Field-Sensitive Reachability and Cyclicity ⋮ S-semantics -- an example ⋮ A new framework for declarative programming ⋮ Semantics of structured normal logic programs ⋮ Generalized metrics and uniquely determined logic programs. ⋮ A simple correctness proof for magic transformation ⋮ A polymorphic type dependency analysis for logic programs ⋮ A compact fixpoint semantics for term rewriting systems ⋮ Abstract deduction and inferential models for type theory ⋮ Compositionality properties of SLD-derivations ⋮ Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements ⋮ S-semantics for logic programming: a retrospective look ⋮ Abstract interpretation of resolution-based semantics ⋮ The reduced relative power operation on abstract domains ⋮ Type dependencies for logic programs using ACI-unification ⋮ On the verification of finite failure ⋮ An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. ⋮ A theory of observables for logic programs