An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.

DOI10.1016/S0304-3975(02)00376-6zbMath1051.68103OpenAlexW1989951844MaRDI QIDQ1853617

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00376-6

zbMATH Keywords

Semantics Compositionality Abstract interpretation SLD-derivations Finite failure

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (2)

S-semantics for logic programming: a retrospective look ⋮ On the verification of finite failure

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Nondeterminism and infinite computations in constraint programming
``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
Closures and fairness in the semantics of programming logic
Declarative modeling of the operational behavior of logic languages
Finite failures and partial computations in concurrent logic languages
A denotational framework for data flow analysis
Constructive versions of Tarski's fixed point theorems
Compositionality properties of SLD-derivations
A model-theoretic reconstruction of the operational semantics of logic programs
A theory of observables for logic programs
Observable behaviors and equivalences of logic programs
Error diagnosis in logic programming an adaptation of E.Y. Shapiro's method
Toward a declarative semantics for infinite objects in logic programming
Contributions to the Theory of Logic Programming
Abstract interpretation and application to logic programs
The s-semantics approach: Theory and applications
Finite failure is and-compositional
“Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
Resultant semantics for prolog
Systematic design of program transformation frameworks by abstract interpretation
A galois connection calculus for abstract interpretation

This page was built for publication: An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.