Approximating the domains of functional and imperative programs

Science of Computer Programming

Volumn 35, Issue 2, 1999, Pages 113-136

  Brauburger, Jürgen ^a   Giesl, Jürgen ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; FUNCTIONS;

AUTOMATED TERMINATION ANALYSIS; PARTIAL FUNCTIONAL PROGRAMS;

PROGRAM DEBUGGING;

EID: 0033224819     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(99)00008-8     Document Type: Article

References (32)

1. P.H. Andersen, C.K. Holst, Termination analysis for offline partial evaluation of a higher order functional language, in: Proc. SAS'96, Lecture Notes in Computer Science, Vol. 1145, Springer, Berlin, 1996, pp. 67-82.
2. A. Bouhoula, M. Rusinowitch, Implicit induction in conditional theories, J. Automat. Reasoning 14 (1995) 189-235.
3. R.S. Boyer, J.S. Moore, A Computational Logic, Academic Press, 1979.
4. R.S. Boyer, J.S. Moore, The addition of bounded quantification and partial functions to a computational logic and its theorem prover, J. Automat. Reasoning 4 (1988) 117-172.
5. J. Brauburger, J. Giesl, Termination analysis for partial functions, in: Proc. SAS'96, Lecture Notes in Computer Science, Vol. 1145, Springer, Berlin, 1996, pp. 113-127.
6. J. Brauburger, J. Giesl, Termination Analysis for Partial Functions, Technical Report IBN-96-33, TH Darmstadt, Germany, 1996. http://www.inferenzsysteme.informatik.tu-darmstadt.de/~reports/notes/ibn-96-33.ps.gz
7. J. Brauburger, Automatic termination analysis for partial functions using polynomial orderings, in: Proc. SAS'97, Lecture Notes in Computer Science, Vol. 1302, Springer, Berlin, 1997, pp. 330-344.
8. J. Brauburger, J. Giesl, Termination analysis by inductive evaluation, in: Proc. 15th CADE, Lecture Notes in Artificial Intelligence, Vol. 1421, Springer, Berlin, 1998, pp. 254-269.
9. J. Brauburger, J. Giesl, Termination Analysis by Inductive Evaluation, Technical Report IBN-98-47, TU Darmstadt, Germany, 1998. http://www. inferenzsysteme.informatik.tu-darmstadt.de/~reports/notes/ibn-98-47.ps.gz
10. A. Bundy, F. van Harmelen, C. Horn, A. Smaill, The OYSTER-CLAM system, in: Proc. 10th CADE, Lecture Notes in Artificial Intelligence, Vol. 449, Springer, Berlin, 1990, pp. 647-648.
11. N. Dershowitz, Termination of rewriting, J. Symbolic Comput. 3 (1987) 69-115.
12. J. Giesl, Generating polynomial orderings for termination proofs, in: Proc. RTA-95, Lecture Notes in Computer Science, Vol. 914, Springer, Berlin, 1995, pp. 426-431.
13. J. Giesl, Automated termination proofs with measure functions, in: Proc. KI-95, Lecture Notes in Artificial Intelligence, Vol. 981, Springer, Berlin, 1995, pp. 149-160.
14. J. Giesl, Termination analysis for functional programs using term orderings, in: Proc. SAS'95, Lecture Notes in Computer Science, Vol. 983, Springer, Berlin, 1995, pp. 154-171.
15. J. Giesl, Automatisierung von Terminierungsbeweisen für Rekursiv Definierte Algorithmen, Ph.D. Thesis, TH Darmstadt, DISKI 96, Infix-Verlag, St. Augustin, 1995.
16. J. Giesl, Termination of nested and mutually recursive algorithms, J. Automat. Reasoning 19 (1997) 1-29.
17. J. Giesl, C. Walther, J. Brauburger, Termination analysis for functional programs, in: W. Bibel, P. Schmitt (Eds.), Automated Deduction - A Basis for Applications, Vol. 3, Kluwer Academic Publishers, Dordrecht, 1998, pp. 135-164.
18. D. Gries, The Science of Programming, Springer, New York, 1981.
19. P. Henderson, Functional Programming, Prentice-Hall, London, 1980.
20. D. Hutter, C. Sengler, INKA: the next generation, in: Proc. 13th CADE, Lecture Notes in Artificial Intelligence, Vol. 1104, Springer, Berlin, 1996, pp. 288-292.
21. D. Kapur, H. Zhang, An overview of rewrite rule laboratory (RRL), J. Comput. Math. Appl. 29 (1995) 91-114.
22. Z. Manna, Mathematical Theory of Computation, McGraw-Hill, New York, 1974.
23. F. Nielson, H.R. Nielson, Operational semantics of termination types, Nordic J. Comput. 3 (1996) 144-187.
24. L. Plümer, Termination Proofs for Logic Programs, Lecture Notes in Artificial Intelligence, Vol. 446, Springer, Berlin, 1990.
25. D. De Schreye, S. Decorte, Termination of logic programs: The never-ending story, J. Logic Programming 19,20 (1994) 199-260.
26. C. Sengler, Termination of algorithms over non-freely generated data types, in: Proc. 13th CADE, Lecture Notes in Artificial Intelligence, Vol. 1104, Springer, Berlin, 1996, pp. 121-135.
27. J. Steinbach, Simplification orderings: History of results, Fund. Inform. 24 (1995) 47-87.
28. J.D. Ullman, A. van Gelder, Efficient tests for top-down termination of logical rules, J. ACM 35 (1988) 345-373.
29. C. Walther, Argument-bounded algorithms as a basis for automated termination proofs, in: Proc. 9th CADE, Lecture Notes in Computer Science, Vol. 310, Springer, Berlin, 1988, pp. 602-621.
30. C. Walther, Automatisierung von Terminierungsbeweisen, Vieweg, Braunschweig, 1991.
31. C. Walther, Mathematical induction, in: D.M. Gabbay, C.J. Hogger, J.A. Robinson (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 2, Oxford University Press, Oxford 1994, pp. 127-231.
32. C. Walther, On proving the termination of algorithms by machine, Artificial Intell. 71 (1994) 101-157.