Practical use of polynomials over the reals in proofs of termination

PPDP'07: Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn , Issue , 2007, Pages 39-50

  Lucas, Salvador ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Polynomial orderings; Program analysis; Term rewriting; Termination

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; INTEGER PROGRAMMING; NUMBER THEORY; POLYNOMIALS; PROBLEM SOLVING;

POLYNOMIAL ORDERINGS; PROGRAM ANALYSIS; TERM REWRITING;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 34548070550     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273920.1273927     Document Type: Conference Paper

References (37)

1. T. Arts and J. Giesl. Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science, 236:133-178, 2000.
2. S. Basu, R. Pollack, and M.-F. Roy. Algorithms in Real Algebraic Geometry. Springer-Verlag, Berlin, 2003.
3. J. Bochnak, M. Coste, and M.-F. Roy. Real Algebraic Geometry. Springer-Verlag, Berlin, 1998.
4. A. ben Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9(2):137-160, 1987.
5. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J. Quesada. Maude: specification and programming in rewriting logic. Theoretical Computer Science 285(2):187-243, 2002.
6. E. Contejean and C. Marché, B. Monate and X. Urbain. Proving termination of rewriting with CiME. In Proc. of WST'03, pages 71-73, Technical Report DSIC 11/15/03, Valencia, Spain, 2003.
7. E. Contejean, C. Marché, A.-P. Tomás, and X. Urbain. Mechanically proving termination using polynomial interpretations. Journal of Automated Reasoning, 34(4):325-363, 2006.
8. N. Dershowitz. A note on simplification orderings. Information Processing Letters, 9(5):212-215, 1979.
9. F. Durán, S. Lucas, J. Meseguer, C. Marché, and X. Urbain. Proving Operational Termination of Membership Equational Programs. Higher-Order and Symbolic Computation, to appear, 2007.
10. J. Giesl. Generating Polynomial Orderings for Termination Proofs. In Proc. of RTA'95, LNCS 914:426-431, Springer-Verlag, Berlin, 1995.
11. J. Giesl, T. Arts, and E. Ohlebusch Modular Termination Proofs for Rewriting Using Dependency Pairs. Journal of Symbolic Computation 34(1):21-58, 2002.
12. J. Giesl, P. Schneider-Kamp, and R. Thiemann. AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework. In Proc. of IJCAR'06, LNAI 4130:281-286, Springer-Verlag, Berlin, 2006.
13. J. Giesl, S. Swiderski, P. Schneider-Kamp, and R. Thiemann. Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. In Proc of RTA '06, LNCS 4098:297-312, Springer Verlag, Berlin, 2006.
14. J. Giesl, R. Thiemann, and P. Schneider-Kamp. The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. In Proc. of LPAR'04, LNCS 3452:301-331, Springer-Verlag, Berlin, 2004.
15. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Mechanizing and Improving Dependency Pairs. Journal of Automated Reasoning, 37(3):155-203, Springer-Verlag, 2006.
16. J.A. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J.-P. Jouannaud. Introducing OBJ. In J. Goguen and G. Malcolm, editors, Software Engineering with OBJ: algebraic specification in action, Kluwer, 2000.
17. N. Hirokawa and A. Middeldorp. Automating the dependency pair method. Information and Computation, 199:172-199, 2005.
18. N. Hirokawa and A. Middeldorp. Tyrolean termination tool: Techniques and features. Information and Computation, 205:474-511, 2007.
19. H. Hong and D. Jakuš. Testing Positiveness of Polynomials. Journal of Automated Reasoning 21:23-38, 1998.
20. P. Hudak, S.J. Peyton-Jones, and P. Wadler. Report on the Functional Programming Language Haskell: a non-strict, purely functional language. Sigplan Notices, 27(5):1-164, 1992.
21. K. Kusakari, M. Nakamura, and Y. Toyama. Argument Filtering Transformation. In G. Nadatur, editor, Proc. of PPDP'99 LNCS 1702:47-61, Springer-Verlag, Berlin, 1999.
22. D.S. Lankford. On proving term rewriting systems are noetherian. Technical Report, Louisiana Technological University, Ruston, LA, 1979.
23. S. Lang. Undergraduate Analysis. Springer-Verlag, Berlin, 2001.
24. S. Lucas. Termination of on-demand rewriting and termination of OBJ programs. In Proc. of 3rd International Conference on Principles and Practice of Declarative Programming, PPDP'01, pages 82-93, ACM Press, 2001.
25. S. Lucas. MU-TERM: A Tool for Proving Termination of ContextSensitive Rewriting In Proc. of RTA'04, LNCS 3091:200-209, 2004.
26. S. Lucas. Polynomials over the reals in proofs of termination: from theory to practice. RAIRO Theoretical Informatics and Applications, 39(3):547-586, 2005.
27. S. Lucas. On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting. Applicable Algebra in Engineering, Communication and Computing, 17(1):49-73, 2006.
28. Y. Matjasevich. Enumerable sets are Diophantine. Soviet Mathematics (Dokladi), 11(2):354-357, 1970.
29. U. Nilsson and J. Maluszynski. Logic, Programming and Prolog (2ed) John Wiley & Sons, 1995
30. E. Ohlebusch. Advanced Topics in Term Rewriting. Springer-Verlag, Berlin, 2002.
31. P. Schneider-Kamp, J. Giesl, A. Serebrenik, and R. Thiemann. Automated Termination Analysis for Logic Programs by Term Rewriting. In Proc. of LOPSTR '06, LNCS to appear, Springer-Verlag, Berlin, 2007.
32. J. Steinbach. Proving Polynomials Positive. In R. K. Shyamasundar, editor, Proc. of FSTTCS'92, LNCS 652:191-202, Springer-Verlag, Berlin, 1992
33. J. Steinbach. Generating Polynomial Orderings. Information Processing Letters 49:85-93, 1994.
34. A. Tarski. A Decision Method for Elementary Algebra and Geometry. Second Edition. University of California Press, Berkeley, 1951.
35. TeReSe, editor, Term Rewriting Systems, Cambridge University Press, 2003.
36. H. Zantema. Termination. In TeReSe, editor, Term Rewriting Systems, Chapter 6, Cambridge University Press, 2003.
37. H. Zantema. TORPA: Termination of String Rewriting Systems. Journal of Automated Reasoning, 34:105-139, 2006.