M. Krishna Rao, D. Kapur, and R. Shyamasundar. Proving termination of GHC programs. In D. S. Warren, editor, Proc. 10th Int. Conf. on Logic Programming, Budapest, Hungary, pages 720--736, Cambridge, MA, 1993. MIT Press.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....and communication dependence which reflects data flows in a single clause due to interprocess communications. We assume that the mode information of each argument position in a concurrent logic program has been inferred by the algorithm proposed by Krishna Rao et al. and has the type, in or out [5]. We use M(ff) to represent the mode of an argument ff and 0(ff) to represent the set of all variables which appear in an argument ff of the program. 5.1.1 Sharing Dependences Sharing dependences reflect data flows in a single clause due to sharing variables. Let P be a concurrent logic program ....

M. R. K. Krishna Rao, D. Kapur, and R. K. Shyamasundar, "Proving Termination of GHC Programs, " Proceedings of the Tenth International Conference on Logic Programming, pp.720-736, MIT Press, 1993.

....of a head literal. In the following we give the formal definitions of these primary program dependences. We assume that the mode information of each argument position in a concurrent logic program has been inferred by the algorithm proposed by Krishna Rao et al. and has the type, in or out [15]. We use M(ff) to represent the mode of an argument ff and 0(ff) to represent the set of all variables which appear in an argument ff of the program. 3.1.1 Sharing Dependences Definition 3.1 (Backward Sharing Dependence) Let P be a concurrent logic program and u; v be two literals of P such ....

....In the following, we briefly introduce those tools in CLPKIDS which have been implemented or are being implemented. The detailed implementation issues can be found in [23] The mode analyzer, Manalyzer, is being implemented by using the mode analysis algorithm proposed by Krishna Rao et al. [15], and at this time the users have to supply this information via declarations in the program. The ADN builder, ADNbuild, uses mode information outputted by the Manalyzer to build the sub ADN containing only sharing and communication dependence arcs for each clause, and then connects these subnets ....

Krishna Rao, M. R. K., Kapur, D. and Shyamasundar, R. K. : Proving Termination of GHC Programs, Proc. of the Tenth International Conference on Logic Programming, MIT Press, pp.720-736 (1993).

....an input or output argument mode indicates whether a data value is required as input or will be produced as output. The mode analyzer, Manalyzer, accepts a source program as input, and produces mode information for each arguments of the program using the algorithm presented in reference [10]. This algorithm outputs modes to any argument positions of clauses in concurrent logic programs. Manalyzer uses database write processor routines to write mode information to the central information database. The program dependence analyzer, DAnalysis, gathers information about program ....

M. R. K. Krishna Rao, D. Kapur, and R. K. Shyamasundar, "Proving Termination of GHC Programs, " Proceedings of the Tenth International Conference on Logic Programming, pp.720-736, MIT Press, 1993.

....to proceed searching along a derivation longer than the longest refutation. Marchiori and Teusink [12] propose a sufficient termination method for so called local selection rules, i.e. rules that resolve completely an atom in a goal before starting resolution of the other atoms. Krishna Rao et al. [11] propose a method for proving termination of GHC programs by transforming a GHC program into a term rewriting systems, and then applying well known techniques for that paradigm. GHC is a concurrent logic language where an atom and a clause can be resolved only if the atom is an instance of the ....

R. K. Shyamasundar M. R. K. Krishna Rao, D. Kapur. Proving termination of GHC programs. New Generation Computing, 15(3):293--338, 1997.

....Our concept of correctness w.r.t. the mode and type system is weaker than the one of wellmodedness, so to have a formal proof of the correctness of this stage one should extend their result 2 . We do not 2 Such an extension is not entirely new. In fact, the same authors of [15] present in [22], in the context of GHC programs, a transformation which enables them to transform a program having only self cycles into a term rewriting system. Although technically different, the idea underlying [22] is very similar to ours. Providing all the details of this requires tools which are beyond ....

....do not 2 Such an extension is not entirely new. In fact, the same authors of [15] present in [22] in the context of GHC programs, a transformation which enables them to transform a program having only self cycles into a term rewriting system. Although technically different, the idea underlying [22] is very similar to ours. Providing all the details of this requires tools which are beyond the scope of this article. The basic idea of our approach is the following: the di erence between the pograms we allow and the ones allowed in [15] lies in the presence of input positions of type ....

[Article contains additional citation context not shown here]

M. R. K. Krishna Rao, D. Kapur, and R. K. Shyamasundar. Proving termination of GHC programs. New Generation Computing, 15(3):293-33, 1997.

....selection rules. The basic idea is not to proceed searching along a derivation via any selection rule which is longer than the depth of SLD trees via semi local selection rules. The method, however, does not distinguishes failed vs successfull derivations. Guarded programs Krishna Rao et al. [14] propose a method for proving termination of GHC programs by transforming a GHC program into a term rewriting system, and then applying well known termination techniques for the paradigm of term rewriting systems. GHC is a concurrent logic language where an atom and a guarded clause can be ....

R. K. Shyamasundar M. R. K. Krishna Rao, D. Kapur. Proving termination of GHC programs. New Generation Computing, 15(3):293-338, 1997.

....logic programs, Ueda and Morita [20] proposed a mode analysis algorithm based on the representation of procedure paths and their relationships as rooted graphs ( rational trees ) Their algorithm gives modes to any path of all predicates in a concurrent logic program. Krishna Rao et al. [13] proposed another mode analysis algorithm. Their algorithm gives modes to any argument positions of clauses in a concurrent logic program. Since in this paper the definition of program dependences between arguments in a concurrent logic program needs only mode information of argument positions of ....

....of clauses in a concurrent logic program. Since in this paper the definition of program dependences between arguments in a concurrent logic program needs only mode information of argument positions of clauses in the program, we adopt the mode analysis algorithm proposed by Krishna Rao et al. [13] for our purpose. Due to the limitation of spaces we will not introduce the algorithm here. The details of the algorithm of how to analyze the mode information of argument positions can be found in [13] In the following we assume that the mode information of each argument position in a ....

[Article contains additional citation context not shown here]

M. R. K. Krishna Rao, D. Kapur, and R. K. Shyamasundar, "Proving Termination of GHC Programs," Proc. Tenth International Conference on Logic Programming, pp.720-736, MIT Press, 1993.

....we introduce two types of primary program dependences named sharing dependence and communication dependence. We assume that the mode information of each argument position in a concurrent logic program has been inferred by the algorithm proposed by Krishna Rao et al. and has the type, in or out [10]. We use M(ff) to represent the mode of an argument ff and 0(ff) to represent the set of all variables which appear in an argument ff of the program. Sharing Dependences Sharing dependences reflect data flows in a single clause due to sharing variables. Let P be a concurrent logic program and ....

M. R. K. Krishna Rao, D. Kapur, and R. K. Shyamasundar, "Proving Termination of GHC Programs," Proceedings of the Tenth International Conference on Logic Programming, pp.720-736, MIT Press, 1993.

....of a head literal. In the following we give the formal definitions of these primary program dependences. We assume that the mode information of each argument position in a concurrent logic program has been inferred by the algorithm proposed by Krishna Rao et al. and has the type, in or out [10]. We use M(ff) to represent the mode of an argument ff and 0(ff) to represent the set of all variables which appear in an argument ff of the program. Sharing Dependences Definition 3.1 (Backward Sharing Dependence) Let P be a concurrent logic program and u; v be two literals of P such that u is ....

M. R. K. Krishna Rao, D. Kapur, and R. K. Shyamasundar, "Proving Termination of GHC Programs," Proceedings of the Tenth International Conference on Logic Programming, pp.720-736, MIT Press, 1993.

No context found.

M.R.K. Krishna Rao, D. Kapur and R.K. Shyamasundar (1993), Proving termination of GHC programs, Proc. of 10 th Intl. Conf. on Logic Prog., ICLP'93, pp. 720-736.

....outside the scope of [30, 34] One of the most interesting aspect of this method has been the mechanizability of the technique and the effective use of theorem provers such as RRL [20] REVE [25] ORME [26] etc. The method has also been adapted for proving termination of parallel logic programs [24]. In the following sections, we discuss a formal approach for proving termination of logic programs using a graphical abstraction of logic programs. The method has the distinct advantage of exploiting programmer s intuition and term structure of the program for proving formal properties ....

Krishna Rao, M.R.K., D. Kapur and R.K. Shyamasundar, Proving Termination of GHC Programs, Proc. ICLP 93, Budapest, MIT Press, Cambridge, pp. 720-736.

....programming is the notion of logic variables that leads to nice implementations of communication protocols (like remote procedure calls, dynamic process migration etc. and makes logic programs particularly suitable for concurrent programming [9] 1 This is a revised and extended version of [13]. 2 Kapur was partially supported by NSF Grant nos. CCR 8906678 and INT 9014074. e mail: krishna tcs.tifr.res.in, kapur cs.albany.edu, shyam tcs.tifr.res.in 1 A logic program is a finite set of universally quantified Horn clauses. A goal statement is used to invoke a computation, which can be ....

....no infinite GHC derivations starting with any query. Though termination of Horn clause programs is well studied in the literature (see [3] for a comprehensive survey) there are not many attempts towards studying termination of concurrent (parallel) logic programs; to the best of our knowledge, [22, 13] seem to be the only published works on this subject. In this paper, we propose a method for showing termination of parallel logic programs, in particular Guarded Horn Clauses. The method reduces the problem of termination of GHC programs into that of term rewriting systems, similar to the ....

M.R.K. Krishna Rao, D. Kapur and R.K. Shyamasundar (1993), Proving termination of GHC programs, Proc. of 10 th Intl. Conf. on Logic Prog., ICLP'93, pp. 720-736.

No context found.

M. Krishna Rao, D. Kapur, and R. Shyamasundar. Proving termination of GHC programs. In D. S. Warren, editor, Proc. 10th Int. Conf. on Logic Programming, Budapest, Hungary, pages 720--736, Cambridge, MA, 1993. MIT Press.

No context found.

M. R. K. Krishna Rao, D. Kapur, and R. K. Shyamasundar. Proving termination of GHC programs. New Generation Computing, 15(3):293--338, 1997.

No context found.

M. Krishna Rao, D. Kapur, and R. Shyamasundar. Proving termination of GHC programs. In D. S. Warren, editor, Proc. 10th Int. Conf. on Logic Programming, Budapest, Hungary, pages 720--736, Cambridge, MA, 1993. MIT Press.

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