K. Vershaetse and D. De Shreye. Deriving Termination Proofs for Logic Programs, Using Abstract Procedures. In K. Furukawa, editor, Proc. Eighth Int'l Conf. on Logic Programming, pages 301--315. The MIT Press, Cambridge, Mass., 1991. This article was processed using the L a T E X macro package with LLNCS style  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Modelling Prolog Control - Roberto Barbuti Michael (1992) (9 citations) (Correct)
....part . Because the declarative semantics of is both simple and in the usual TP style it provides a suitable basis for abstract interpretation of Prolog via the defined transformation. The required termination theory can be approximated either by integrating results on Prolog termination (e.g. [2, 7, 21, 23]) or by extending the language so as to model termination from within and applying abstract interpretation. The basic idea of defining semantics for Prolog without considering notions such as depth first search and backtracking, which are more (sequential) implementation oriented is an important ....
K. Vershaetse and D. De Shreye. Deriving Termination Proofs for Logic Programs, Using Abstract Procedures. In K. Furukawa, editor, Proc. Eighth Int'l Conf. on Logic Programming, pages 301-- 315. The MIT Press, Cambridge, Mass., 1991.
Modelling Prolog Control - Barbuti, Codish, Giacobazzi, Levi (1992) (9 citations) (Correct)
....part . Because the declarative semantics of is both simple and in the usual TP style it provides a suitable basis for abstract interpretation of Prolog via the defined transformation. The required termination theory can be approximated either by integrating results on Prolog termination (e.g. [2, 9, 26, 29]) or by extending the language so as to model termination from within and applying abstract interpretation. The basic idea of defining semantics for Prolog without considering notions such as depth first search and backtracking, which are more (sequential) implementation oriented is an important ....
K. Vershaetse and D. De Shreye. Deriving Termination Proofs for Logic Programs, Using Abstract Procedures. In K. Furukawa, editor, Proc. Eighth Int'l Conf. on Logic Programming, pages 301--315. The MIT Press, Cambridge, Mass., 1991. 33
Oracle Semantics for Prolog - Roberto Barbuti (1992) (9 citations) (Correct)
....and the deductive part (which can be expressed operationally or declaratively) If we wish to obtain approximate semantics of Prolog, for program analysis, we can approximate each of these components independently. Thus oracle semantics provides a framework for combining work on termination [1, 2, 3, 22] with work on semantics based analysis (e.g. abstract interpretation, type inference) Usual analyses, which are based on the semantics of sequential logic programs, can be viewed as using the trivial termination approximation: the oracle f = P:s:P . Any more powerful oracle for termination will ....
K. Vershaetse and D. De Shreye. Deriving Termination Proofs for Logic Programs, Using Abstract Procedures. In K. Furukawa, editor, Proc. Eighth Int'l Conf. on Logic Programming, pages 301--315. The MIT Press, Cambridge, Mass., 1991. This article was processed using the L a T E X macro package with LLNCS style
Modelling Prolog Control - Roberto Barbuti (1992) (9 citations) (Correct)
....part . Because the declarative semantics of is both simple and in the usual TP style it provides a suitable basis for abstract interpretation of Prolog via the defined transformation. The required termination theory can be approximated either by integrating results on Prolog termination (e.g. [2, 7, 21, 23]) or by extending the language so as to model termination from within and applying abstract interpretation. The basic idea of defining semantics for Prolog without considering notions such as depth first search and backtracking, which are more (sequential) implementation oriented is an important ....
K. Vershaetse and D. De Shreye. Deriving Termination Proofs for Logic Programs, Using Abstract Procedures. In K. Furukawa, editor, Proc. Eighth Int'l Conf. on Logic Programming, pages 301-- 315. The MIT Press, Cambridge, Mass., 1991.
Oracle Semantics for Prolog - Roberto Barbuti Michael (1992) (9 citations) (Correct)
No context found.
K. Vershaetse and D. De Shreye. Deriving Termination Proofs for Logic Programs, Using Abstract Procedures. In K. Furukawa, editor, Proc. Eighth Int'l Conf. on Logic Programming, pages 301--315. The MIT Press, Cambridge, Mass., 1991. This article was processed using the L a T E X macro package with LLNCS style
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC