Program termination analysis in polynomial time

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

Volumn 2487, Issue , 2002, Pages 218-235

  Lee, Chin Soon ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ANCHORS; POLYNOMIAL APPROXIMATION;

EFFECTIVENESS AND EFFICIENCIES; INFINITE OCCURRENCE; POLYNOMIAL-TIME; PROGRAM CONTROL; PROGRAM TERMINATION; SIZE CHANGE GRAPHS; SIZE-CHANGE PRINCIPLE; STATE TRANSITIONS;

GRAPHIC METHODS;

EID: 84937435408     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45821-2_14     Document Type: Conference Paper

References (15)

1. K. R. Apt and D. Pedreschi. Modular termination proofs for logic and pure prolog programs. In Advances in Logic Programming Theory, pages 183–229. Oxford University Press, 1994.
2. F. Bueno, M. Garcıa de la Banda, and M. Hermenegildo. Effectiveness of global analysis in strict independence-based automatic program parallelization. In International Symposium on Logic Programming, pages 320–336. MIT Press, 1994.
3. Michael Codish and Cohavit Taboch. Aseman tic basis for termination analysis of logic programs and its realization using symbolic norm constraints. In Michael Hanus, Jan Heering, and Karl Meinke, editors, Algebraic and Logic Programming, 6th International Joint Conference, ALP ’97–HOA ’97, Southampton, U.K., Sep 3–5, 1997, volume 1298 of LNCS, pages 31–45. Springer, 1997.
4. D. De Schreye and S. Decorte. Termination of logic programs: The never-ending story. The Journal of Logic Programming, 19–20:199–260, 1994.
5. Carl C. Frederiksen. SCT analyzer. At http://www.diku.dk/∼xeno/sct.html.
6. Carl C. Frederiksen. Asimple implementation of the size-change principle. Technical Report D-442, Datalogisk Institut Københavns Universitet, 2001.
7. Neil Jones and Arne Glenstrup. Program generation, termination, and bindingtime analysis. In Principles, Logics, and Implementations of High-Level Programming Languages, PLI 2002 (invited paper). Springer, 2002.
8. Chin Soon Lee. Partial evaluation of the euclidean algorithm, revisited. Higher- Order and Symbolic Computation, 12(2):203–212, Sep 1999.
9. Chin Soon Lee. Program Termination Analysis, and Termination of Offline Partial Evaluation. PhD thesis, UWA, University of Western Australia, Australia, 2001.
10. Chin Soon Lee. Finiteness analysis in polynomial time. In M. Hermenegildo and G. Puebla, editors, Proceedings of Static Analysis Symposium, volume 2477 of LNCS. Springer, 2002.
11. Chin Soon Lee. Program termination analysis in polynomial time (with proofs). To be available as a technical report at DIKU, Denmark, 2002.
12. Chin Soon Lee, Neil D. Jones, and Amir Ben-Amram. The size-change principle for program termination. In Proceedings of the ACM Symposium on Principles of Programming Languages, Jan 2001. ACM, 2001.
13. Naomi Lindenstrauss and Yehohua Sagiv. Automatic termination analysis of logic program (with detailed experimental results). Article available at http://www.cs.huji.ac.il/∼naomil/, 1997.
14. Lutz Pl¨umer. Termination Proofs for Logic Programs, volume 446 of LNAI. Springer-Verlag, 1990.
15. Wim Vanhoof and Maurice Bruynooghe. Binding-time annotations without binding-time analysis. In Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), 8th International Conference, Havana, Cuba, Dec 3-7, 2001, volume 2250 of LNCS, pages 707–722, 2001.