An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
type: Item
instance of: scholarly article
title: An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
zbMATH Open document ID: 1051.68103
DOI: 10.1016/S0304-3975(02)00376-6
author: Roberta Gori
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 1857134
zbMATH Keywords: SLD-derivations
zbMATH Keywords: Semantics
zbMATH Keywords: Compositionality
zbMATH Keywords: Finite failure
zbMATH Keywords: Abstract interpretation
MaRDI profile type: Publication
cites work: Contributions to the Theory of Logic Programming
cites work: The s-semantics approach: Theory and applications
cites work: A theory of observables for logic programs
cites work: Compositionality properties of SLD-derivations
cites work: Q3922128
cites work: ``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs
cites work: Q3968981
cites work: Constructive versions of Tarski's fixed point theorems
cites work: Systematic design of program transformation frameworks by abstract interpretation
cites work: A galois connection calculus for abstract interpretation
cites work: Abstract interpretation and application to logic programs
cites work: Nondeterminism and infinite computations in constraint programming
cites work: Finite failures and partial computations in concurrent logic languages
cites work: Declarative modeling of the operational behavior of logic languages
cites work: A model-theoretic reconstruction of the operational semantics of logic programs
cites work: Error diagnosis in logic programming an adaptation of E.Y. Shapiro's method
cites work: Observable behaviors and equivalences of logic programs
cites work: Resultant semantics for prolog
cites work: “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
cites work: Toward a declarative semantics for infinite objects in logic programming
cites work: Q2767031
cites work: Finite failure is and-compositional
cites work: Q4494369
cites work: Closures and fairness in the semantics of programming logic
cites work: Q3339245
cites work: Q3221399
cites work: A denotational framework for data flow analysis
full work available at URL: s0304-3975(02)00376-6
OpenAlex ID: W1989951844
description: scientific article; zbMATH DE number 1857134