A Fixpoint Semantics for Reasoning about Finite Failure

Authors:
Roberta Gori
Affiliations:
-
Venue:
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Year:
1999

Citing 9
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Declarative modeling of the operational behavior of logic languages

Theoretical Computer Science
Logic programming

Handbook of theoretical computer science (vol. B)
Failure and success made symmetric

Proceedings of the 1990 North American conference on Logic programming
Compositionality properties of SLD-derivations

Theoretical Computer Science
Contributions to the Theory of Logic Programming

Journal of the ACM (JACM)
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the Verification of Finite Failure

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Our aim is to define a new fixpoint semantics which correctly models finite failure. In order to achieve this goal a new fixpoint operator is derived from a "suitable" concrete semaoitics by defining a Galois insertion modeling finite failure. The corresponding abstract fixpoint semantics correctly models finite failure and is and-compositional.