Termination by abstraction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3132, Issue , 2004, Pages 1-18

  Dershowitz, Nachum ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BIOGRAPHIES; COMPUTATION THEORY; LOGIC PROGRAMMING;

ABSTRACT FRAMEWORK; MULTIPLE LEVELS; SYMBOLIC COMPUTATION; TERMINATION ARGUMENTS; TERMINATION METHOD;

ABSTRACTING;

EID: 35048895939     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27775-0_1     Document Type: Article

References (46)

1. Thomas Arts and Jürgen Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
2. Thomas Arts and Hans Zantema. Termination of logic programs using semantic unification. In M. Proietti, editor, Proceedings of the Fifth International Workshop on Logic Program Synthesis and Transformation, volume 1048 of Lecture Notes in Computer Science, pages 219-233, Berlin, 1996. Springer-Verlag.
3. Leo Bachmair and Nachum Dershowitz. Commutation, transformation, and termination. In J. H. Siekmann, editor, Proceedings of the Eighth International Conference on Automated Deduction (Oxford, England), volume 230 of Lecture Notes in Computer Science, pages 5-20, Berlin, July 1986. Springer-Verlag.
4. Françoise Bellegarde and Pierre Lescanne. Termination by completion. Applied Algebra on Engineering, Communication and Computer Science, 1(2):79-96, 1990.
5. Cristina Borralleras, Maria Ferreira, and Albert Rubio. Complete monotonic semantic path orderings. In Proceedings of the Seventeenth International Conference on Automated Deduction (Pittsburgh, PA), volume 1831 of Lecture Notes in Artificial Intelligence, pages 346-364. Springer-Verlag, June 2000.
6. Jacques Chabin and Pierre Réty. Narrowing directed by a graph of terms. In R. V. Book, editor, Rewriting Techniques and Applications: Proceedings of the Fourth International Conference (RTA-91), pages 112-123. Springer, Berlin, 1991.
7. Michael Codish, Samir Genaim, Maurice Bruynooghe, John Gallagher, and Wim Vanhoof. One loop at a time. In 6th International Workshop on Termination (WST 2003), June 2003.
8. Michael Codish and Cohavit Taboch. A semantic basis for the termination analysis of logic programs. J. Logic Programming, 41(1):103-123, 1999.
9. Patrick M. Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 238-252, Los Angeles, California, 1977. ACM Press, New York, NY.
10. Danny De Schreye and Stefaan Decorte. Termination of logic programs: The never-ending story. J. Logic Programming, 19/20:199-260, 1993.
11. Nachum Dershowitz. Termination of linear rewriting systems. In Proceedings of the Eighth International Colloquium on Automata, Languages and Programming (Acre, Israel), volume 115 of Lecture Notes in Computer Science, pages 448-458, Berlin, July 1981. European Association of Theoretical Computer Science, Springer-Verlag.
12. Nachum Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279-301, March 1982.
13. Nachum Dershowitz. Termination of rewriting. J. Symbolic Computation, 3(1&2): 69-115, February/April 1987.
14. Nachum Dershowitz and Charles Hoot. Natural termination. Theoretical Computer Science, 142(2):179-207, May 1995.
15. Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics, chapter 6, pages 243-320. North-Holland, Amsterdam, 1990.
16. Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, and Alexander Serebrenik. A general framework for automatic termination analysis of logic programs. Applicable Algebra in Engineering, Communication and Computing, 12(1/2):117-156, 2001.
17. Nachum Dershowitz and Zohar Manna. Proving termination with multiset orderings. Communications of the ACM, 22(8):465-476, August 1979.
18. Nachum Dershowitz, Mitsuhiro Okada, and G. Sivakumar. Confluence of conditional rewrite systems. In S. Kaplan and J.-P. Jouannaud, editors, Proceedings of the First International Workshop on Conditional Term Rewriting Systems (Orsay, France), volume 308 of Lecture Notes in Computer Science, pages 31-44, Berlin, July 1987. Springer-Verlag.
19. Nachum Dershowitz and David A. Plaisted. Equational programming. In J. E. Hayes, D. Michie, and J. Richards, editors, Machine Intelligence 11: The logic and acquisition of knowledge, chapter 2, pages 21-56. Oxford Press, Oxford, 1988.
20. Nachum Dershowitz and David A. Plaisted. Rewriting. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 9, pages 535-610. Elsevier Science, 2001.
21. Nachum Dershowitz and G. Sivakumar. Goal-directed equation solving. In Proceedings of the Seventh National Conference on Artificial Intelligence, pages 166-170, St. Paul, MN, August 1988. AAAI.
22. Robert W. Floyd. Assigning meanings to programs. In Proceedings of Symposia in Applied Mathematics, XIX: Mathematical Aspects of Computer Science, pages 19-32, Providence, RI, 1967. American Mathematical Society.
23. Alfons Geser. An improved general path order. Applicable Algebra in Engineering, Communication, and Computing, 7(6):469-511, 1996.
24. Oliver Geupel. Overlap closures and termination of term rewriting systems. Report MIP-8922, Universität Passau, Passau, West Germany, July 1989.
25. Jürgen Giesl and Deepak Kapur. Dependency pairs for equational rewriting. In Proceedings of the Twelfth International Conference on Rewriting Techniques and Applications (Utrecht, The Netherlands), volume 2051 of Lecture Notes in Computer Science, pages 93-107. Springer-Verlag, 2001.
26. David Gries. Is sometime ever better than alway? ACM Transactions on Programming Languages and Systems, 1(2):258-265, October 1979.
27. Michael Hanus. The integration of functions into logic programming: From theory to practice. J. Logic Programming, 19&20:583-628, 1994.
28. Jean-Marie Hullot. Canonical forms and unification. In R. Kowalski, editor, Proceedings of the Fifth International Conference on Automated Deduction (Les Arcs, France), volume 87 of Lecture Notes in Computer Science, pages 318-334, Berlin, July 1980. Springer-Verlag.
29. Sam Kamin and Jean-Jacques Lévy. Two generalizations of the recursive path ordering, February 1980. Unpublished note, Department of Computer Science, University of Illinois, Urbana, IL.
30. Available at http://www.ens-lyon.fr / LIP / REWRITING / OLD_PUBLICATIONS_ON_ TERMINATION / KAMIN_LEVY (viewed June 2004).
31. Shmuel M. Katz and Zohar Manna. A closer look at termination. Acta Informatica, 5(4):333-352, December 1975.
32. Laurie Kirby and Jeff Paris. Accessible independence results for Peano arithmetic. Bulletin London Mathematical Society, 14:285-293, 1982.
33. Dallas S. Lankford. On proving term rewriting systems are Noetherian. Memo MTP-3, Mathematics Department, Louisiana Tech. University, Ruston, LA, May 1979. Revised October 1979.
34. Chin Soon Lee, Neil D. Jones, and Amir M. Ben-Amram. The size-change principle for program termination. In Conference Record of the Twenty-Eighth Symposium on Principles of Programming Languages, volume 36 (3), pages 81-92, London, UK, January 2001. ACM SIGPLAN Notices.
35. Zohar Manna. Mathematical Theory of Computation. McGraw-Hill, New York, 1974.
36. Aart Middeldorp, June 2003. Personal communication.
37. Enno Ohlebusch, Claus Claves, and Claude Marché. TALP: A tool for the termination analysis of logic programs. In P. Narendran and M. Rusinowitch, editors, Proceedings of the Tenth International Conference on Rewriting Techniques and Applications (Trento, Italy), volume 1631 of Lecture Notes in Computer Science, pages 270-273, Berlin, July 1999. Springer-Verlag.
38. David A. Plaisted. Semantic confluence tests and completion methods. Information and Control, 65(2/3):182-215, 1985.
39. Yehoshua Sagiv. A termination test for logic programs. In Logic Programming: Proceedings of the 1991 International Symposium, pages 518-532, San Diego, CA, October 1991. MIT Press.
40. Alexander Serebrenik. Termination Analysis of Logic Programs. PhD thesis, Katholieke Universiteit Leuven, Leuven, Belgium, July 2003.
41. Michele Sintzoff. Calculating properties of programs by valuations on specific models. Proceedings of the ACM Conference on Proving Assertions About Programs, 7(1):203-207, January 1972.
42. William W. Tait. Intensional interpretations of functionals of finite type I. Journalof Symbolic Logic, 32(2):198-212, 1967.
43. "Terese" (M. Bezem, J. W. Klop and R. de Vrijer, eds.). Term Rewriting Systems. Cambridge University Press, 2002.
44. Alan M. Turing. Checking a large routine. In Report of a Conference on High Speed Automatic Calculating Machines, pages 67-69, Cambridge, England, 1949. University Mathematics Laboratory.
45. Kristof Vershaetse and Danny De Schreye. Deriving termination proofs for logic programs, using abstract procedures. In K. Furukawa, editor, Proceeedings of the Eighth International Conference on Logic Programming, pages 301-315, Cambridge, MA, 1991. The MIT Press.
46. Ben Wegbreit. Property extraction in well-founded property sets. IEEE Transactions on Software Engineering, SE-1(3):270-285, September 1975.