Error diagnosis in logic programming, an adaptation of E.Y. Shapiro's method
Journal of Logic Programming
Inductive assertion method for logic programs
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
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)
A first-order language for expressing sharing and type properties of logic programs
Science of Computer Programming - Special issue n static program analysis (SAS'98)
On the Verification of Finite Failure
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Derivation of Proof Methods by Abstract Interpretation
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Detecting Unsolvable Queries for Definite Logic Programs
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
S-semantics for logic programming: A retrospective look
Theoretical Computer Science
| Hi-index | 0.00 |
In Gori [An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations, Theoret. Comput. Sci. 290(1) (2003) 863-936] a new fixpoint semantics which correctly models finite failure has been defined. This semantics is And-compositional, compositional w.r.t. instantiation and is based on a co-continuous operator. Based on this fixpoint semantics a new inductive method able to verify a program w.r.t. the property of finite failure can be defined. In this paper we show how Ferrand's approach, using both a least fixpoint and greatest fixpoint semantics, can be adapted to finite failure. The verification method is not effective. Therefore, we consider an approximation from above and an approximation from below of our semantics, which give two different finite approximations. These approximations are used for effective program verification.