Proving termination of GHC programs

New Generation Computing

Volumn 15, Issue 3, 1997, Pages 293-338

  Krishna Rao, M R K ^a,c,d   Kapur, D ^b,e,f,g   Shyamasundar, R K ^{a,h,i,j,k,l,m,n,o}  

^a TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^b STATE UNIVERSITY OF NEW YORK   (United States)

^c GRIFFITH UNIVERSITY   (Australia)

^d MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^e STATE UNIVERSITY OF NEW YORK   (United States)

^f MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^g Gen Elec Corp R and D   (United States)

^h INDIAN INSTITUTE OF SCIENCE   (India)

ⁱ EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^j UTRECHT UNIVERSITY   (Netherlands)

^k PENNSYLVANIA STATE UNIVERSITY   (United States)

^l UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^m PSL RESEARCH UNIVERSITY   (France)

ⁿ Program Committees

^o Editorial Committees   (Canada)

more..

Author keywords

Parallel Logic Programming; Termination; Verification

Indexed keywords

COMPUTER APPLICATIONS; COMPUTER PROGRAMMING; COMPUTER SOFTWARE; PARALLEL PROCESSING SYSTEMS;

PARALLEL LOGIC PROGRAMMING; TERMINATION; VERIFICATION;

LOGIC PROGRAMMING;

EID: 0031379936     PISSN: 02883635     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03037949     Document Type: Article

References (31)

1. Dauchet, M., "Simulation of Turing Machines by a Left-Linear Rewrite Rule," Proc. of RTA'89, Lecture Notes in Computer Science, 355, Springer-Verlag, pp. 109-120, 1989.
2. De Schreye, D. and Decorte, S., "Termination of Logic Programs : The Never-Ending Story," J. Logic Programming, 19/20, pp. 199-260, 1993.
3. Dershowitz, N., "Orderings for Term-Rewriting Systems," TCS, 17, pp. 279-301, 1982.
4. Dershowitz, N., "Termination of Rewriting," J. Symb. Comp., 3, pp. 69-116, 1987.
5. Furukawa, K., Okumura, A., and Murakami, M., "Unfolding Rules for GHC Programs," New Generation Computing, 6, pp. 143-157, 1988.
6. Harel, D. and Pnueli, A., "On the Development of Reactive Systems," in Logics and Models of Concurrent Systems (K. R. Apt, ed.), Springer-Verlag, 1985.
7. Kamin, S. and Levi, J.-J., "Two Generalizations of Recursive Path Ordering," unpublished note. Department of Computer Science, University of Illinois, Urbana, 1980.
8. Kapur, D. and Zhang, H., "An Overview of Rewrite Rule Laboratory (RRL)," Proc. of RTA'89, Lecture Notes in Computer Science, 355, Springer-Verlag, pp. 559-563, 1989.
9. Kleinman, A., Moscowitz, Y., Pnueli, A., and Shapiro, E., "Communication with Directed Logic Variables," Proc. 18th ACM Symposium on Principles of Programming Languages, POPL'91, pp. 221-232, 1991.
10. Krishna Rao, M. R. K., Kapur, D., and Shyamasundar, R. K., "A Transformational Methodology for Proving Termination of Logic Programs," Proc. of Computer Science Logic, CSL'91, Lecture Notes in Computer Scienc, 626, Springer-Verlag, pp. 213-226, 1991. Revised version to appear in J. Logic Programming, 1997.
11. Krishna Rao, M. R. K., Kapur, D., and Shyamasundar, R. K., "A Transformational Methodology for Proving Termination of Logic Programs," Proc. of Computer Science Logic, CSL'91, Lecture Notes in Computer Scienc, 626, Springer-Verlag, pp. 213-226, 1991. Revised version to appear in J. Logic Programming, 1997.
12. Krishna Rao, M. R. K., Pandya, P. K., and Shyamasundar, R. K., "Verification Tools in the Development of Provably Correct Compilers," Proc. of 5th Symposium on Formal Methods Europe, FME'93, Lecture Notes in Computer Science, 670, Springer-Verlag, pp. 442-461, 1993.
13. Krishna Rao, M. R. K., Kapur, D., and Shyamasundar, R. K., "Proving Termination of GHC Programs," Proc. of 10th International Conference on Logic Programming, ICLP'93, pp. 720-736, 1993.
14. Lescanne, P., "Computer Experiments with the REVE Term Rewriting Systems Generator," Proc. of 10th ACM POPL'83, pp. 99-108, 1983.
15. Lescanne, P., "Termination of Rewriting Systems by Elementary Interpretations," Proc. of Algebraic and Logic Programming, ALP'92, Lecture Notes in Computer Science, 632, Springer-Verlag, pp. 21-36, 1992.
16. Massey, B. and Tick, E., "Sequentialization of Parallel Logic Programs with Mode Analysis," Proc. of LPAR'93, Lecture Notes in Computer Science, 698, Springer-Verlag, pp. 205-216, 1993.
17. Tick, E. and Koshimura., "Static Analysis of Concurrent Logic Programs," J. of Programming Language Design and Implementation, 1995.
18. Plümer, L., "Termination Proofs for Logic Programs," Ph.D. thesis, University of Dortmund. Also appears as Lecture Notes in Computer Science, 446, Springer-Verlag, 1990.
19. Plümer, L., "Automatic Termination Proofs for Prolog Programs Operating on Non-ground Terms," Proc. of International Logic Programming Symposiun, ILPS'91, pp. 503-517, 1991.
20. Plümer, L., "Automatic Verification of Parallel Logic Programs: Termination" in Logic Programming: Formal Methods and Practical Applications (C. Beirle and L. Plumer, ed.), North-Holland, 1994. Preliminary version as "Automatic Verification of GHC-Programs: Termination," Proc. of FGCS'92.
21. Plümer, L., "Automatic Verification of Parallel Logic Programs: Termination" in Logic Programming: Formal Methods and Practical Applications (C. Beirle and L. Plumer, ed.), North-Holland, 1994. Preliminary version as "Automatic Verification of GHC-Programs: Termination," Proc. of FGCS'92.
22. Shapiro, E., Concurrent Prolog, collected papers Volume 1 and 2, MIT Press, 1987.
23. Shapiro E., "The Family of Concurrent Logic Programming Languages," ACM Computing Surveys, 21 pp. 413-510, 1989.
24. Shyamasundar, R. K., Krishna Rao, M. R. K., and Kapur, D., "Rewriting Concepts in the Study of Termination of Logic Programs," Proc. of ALPUK'92 Conference (K. Broda, ed.), Workshops in Computing Series, Springer-Verlag, pp. 3-20, 1990.
25. Takeuchi, A. and Furukawa, K., "Parallel Logic Programming Languages," in Concurrent Prolog (E. Shapiro, ed.), Chapter 6, pp. 188-201, 1987.
26. Ueda, K., "Guarded Horn Clauses," Proc. of Logic Programming'85, Lecture Notes in Computer Science, 221, Springer-Verlag, pp. 168-179, 1985. Also appears as chapter 4 in Ref. 20).
27. Ueda, K. and Furnkawa, K., "Transformation Rules for GHC programs," Proc. of FGCS'88, pp. 582-591, 1988.
28. Ueda, K., "Designing a Concurrent Programming Language," Proc. of InfoJapan'90 (organized by the Information Processing Society of Japan), pp. 87-94, 1990.
29. Ueda K. and Morita, M., "A New Implementation Technique for Flat GHC," Proc. of International Conference Logic Programming, ICLP'90, pp. 3-17, 1990. Revised version appears as "Moded Flat GHC and Its Message-Oriented Implementation Technique," New Generation Computing, 13, pp. 3-43.
30. Ueda K. and Morita, M., "A New Implementation Technique for Flat GHC," Proc. of International Conference Logic Programming, ICLP'90, pp. 3-17, 1990. Revised version appears as "Moded Flat GHC and Its Message-Oriented Implementation Technique," New Generation Computing, 13, pp. 3-43.
31. Ueda, K., "I/O Mode Analysis in Concurrent Logic Programming," Proc. of TPPP'94, Lecture Notes in Computer Science, 907, Springer-Verlag, pp. 356-368, 1994.