M.R.K. Krishna Rao, D. Kapur, R.K. Shyamasunder  Home/Search
Context Related
| tcs.tifr.res.in:80/~shyam/ghc.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: tcs.tifr.res.in:...pub_logic_prog (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A transformational approach for proving termination of parallel logic programs such as GHC programs is proposed. A transformation from GHC programs to term rewriting systems is developed; it exploits the fact that unifications in GHC-resolution correspond to matchings. The termination of a GHC program for a class of queries is implied by the termination of the resulting rewrite system. This approach facilitates the applicability of a wide range of termination techniques developed for rewrite... (Update)
Context of citations to this paper: More
.... 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...
.... 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...
Cited by: More
State-Space Reduction Techniques in Agent Verification - Rafael Bordini Michael (2004) (Correct)
Characterisations of Termination in Logic Programming - Pedreschi, Ruggieri, Smaus (Correct)
Computing Executable Slices for Concurrent Logic Programs - Zhao, Cheng, Ushijima (2001) (Correct)
Similar documents (at the sentence level):
49.4%: Proving Termination of GHC Programs - Rao, Kapur (1993) (Correct)
8.0%: A Transformational Methodology for Proving Termination of.. - Rao, Kapur, al. (1991) (Correct)
Active bibliography (related documents): More All
0.6: A Methodology For Proving Termination Of Logic Programs - Wang, Shyamasundar (1991) (Correct)
0.6: Automated Verification Of Prolog Programs - Le Charlier, Leclere, Rossi.. (1994) (Correct)
0.3: Automated Programming Framework Using - Constraint-Based Static Analysis (Correct)
Similar documents based on text: More All
0.9: Interval Duration Logic: Expressiveness and Decidability - Pandya (2001) (Correct)
0.8: Cv - Mahimkar (Correct)
0.7: Guarded Horn Clauses: A Parallel Logic Programming Language with.. - Ueda (1987) (Correct)
Related documents from co-citation: More All
7: A transformational methodology for proving termination of logic programs - Rao, Kapur et al. - 1991
6: Program Dependence Analysis of Concurrent Logic Programs and Its Applications - Zhao, Cheng et al. - 1996
6: Design of the kernel language for the parallel inference machine - Ueda, Chikayama - 1990
BibTeX entry: (Update)
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. http://citeseer.ist.psu.edu/article/krishnarao93proving.html More
@inproceedings{ rao93proving,
author = "M. R. K. Krishna Rao and Deepak Kapur and R. K. Shyamasundar",
title = "Proving Termination of {GHC} Programs",
booktitle = "International Conference on Logic Programming",
pages = "720-736",
year = "1993",
url = "citeseer.ist.psu.edu/article/krishnarao93proving.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
474 Term Rewriting Systems - Klop - 1992
247 The family of concurrent logic programming languages (context) - Shapiro - 1989
214 Orderings for term-rewriting systems (context) - Dershowitz - 1982
192 Logic Programming (context) - Apt - 1990
129 Termination of rewriting (context) - Dershowitz - 1987
121 Guarded Horn Clauses - Ueda - 1985
82 Two generalizations of recursive path ordering (context) - Kamin, Levi - 1980
77 Termination of logic programs: the never-ending story (context) - De Schreye, Decorte - 1993
43 An overview of Rewrite Rule Laboratory (context) - Kapur, Zhang - 1989
42 Termination proofs for logic programs (context) - Plumer - 1990
36 A Transformational methodology for proving termination of lo.. - Rao, Kapur et al. - 1991
26 Simulation of Turing machines by a left-linear rewrite rule (context) - Dauchet - 1989
25 A new implementation technique for flat GHC (context) - Ueda, Morita - 1990
21 Concurrent Prolog (context) - Shapiro - 1987
19 Computer experiments with the REVE term rewriting systems ge.. (context) - Lescanne - 1983
18 Parallel logic programming languages (context) - Takeuchi, Furukawa - 1987
15 Transformation rules for GHC programs - Ueda, Furukawa - 1988
15 Proving termination of GHC programs - Rao, Kapur et al. - 1993
11 Sequentialization of parallel logic programs with mode analy.. - Massey, Tick - 1993
10 Automatic termination proofs for Prolog programs operating o.. (context) - Plumer - 1991
8 Rewriting concepts in the study of termination of logic Prog.. (context) - Shyamasundar, Rao et al. - 1990
7 mode analysis in concurrent logic programming (context) - Ueda - 1994
6 Verification tools in the development of provably correct co.. - Rao, Pandya et al. - 1993
6 Designing a concurrent programming language - Ueda - 1990
4 Termination of rewriting systems by elementary interpretatio.. (context) - Lescanne - 1992
4 Unfolding rules for GHC programs (context) - Furukawa, Okumura et al. - 1988
2 Communication with Directed Logic Variables proc (context) - Kleinman, Moscowitz et al. - 1991
2 Static analysis of concurrent logic programs (context) - Tick - 1995
2 Automatic verification of GHC-programs: termination (context) - Plumer - 1992
1 Canonical algebraic specification in computational logic (context) - Lankford - 1975
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.tcs.tifr.res.in:80/~shyam/pub_logic_prog.html): More
A Transformational Methodology for Proving Termination of.. - Rao, Kapur, al. (1991) (Correct)
Unification-free Execution of Well-moded and Well-typed.. - Rao, Shyamasundar (1994) (Correct)
Verification Tools in the Development of Provably Correct.. - Rao, Pandya, Shymasunder (1993) (Correct)
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