Testing for termination with monotonicity constraints

Lecture Notes in Computer Science

Volumn 3668, Issue , 2005, Pages 326-340

  Codish, Michael ^a,b   Lagoon, Vitaly ^b   Stuckey, Peter J ^b,c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF MELBOURNE   (Australia)

^c CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; FUNCTION EVALUATION; GRAPH THEORY; MATHEMATICAL OPERATORS; SET THEORY;

MONOTONICITY CONSTRAINTS; RANKING FUNCTIONS; SIZE CHANGE GRAPHS; TERMINATION ANALYSIS;

CONSTRAINT THEORY;

EID: 27144434808     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11562931_25     Document Type: Conference Paper

References (13)

1. A. Brodsky and Y. Sagiv. Inference of monotonicity constraints in Datalog programs. In Proceedings of the Eighth ACM SIGACT-SIGART-SIGMOD Symposium on Principles of Database Systems, pages 190-199, 1989.
2. M. Codish and C. Taboch. A semantic basis for the termination analysis of logic programs. The Journal of Logic Programming, 41(1):103-123, 1999.
3. N. Dershowitz, N. Lindenstrauss, Y. Sagiv, and A. Serebrenik. A general framework for automatic termination analysis of logic programs. Applicable Algebra in Engineering, Communication and Computing, 12(1-2):117-156, 2001.
4. C. C. Frederiksen. A simple implementation of the size-change termination principle. Technical Report D-442, DIKU, Copenhagen University, Denmark, 2001.
5. G. Probenius. Über endliche gruppen. Sitzungsber. Preuss. Akad. Wiss. Berlin, pages 163-194, 1895.
6. M. Gabbrielli and R. Giacobazzi. Goal independency and call patterns in the analysis of logic programs. In Proceedings of the Ninth ACM Symposium on Applied Computing, pages 394-399. ACM Press, 1994.
7. C. S. Lee, N. D. Jones, and A. M. Ben-Amram. The size-change principle for program termination. ACM SIGPLAN Notices, 36(3):81-92, 2001. Proceedings of POPL'01.
8. N. Lindenstrauss and Y. Sagiv. Automatic termination analysis of logic programs. In L. Naish, editor, Proceedings of the Fourteenth International Conference on Logic Programming, pages 63-77, Leuven, Belgium, 1997. The MIT Press.
9. N. Lindenstrauss, Y. Sagiv, and A. Serebrenik. Termilog: A system for checking termination of queries to logic programs. In O. Grumberg, editor, CAV, volume 1254 of Lecture Notes in Computer Science, pages 444-447. Springer, 1997.
10. A. Podelski and A. Rybalchenko. A complete method for the synthesis of linear ranking functions. In B. Steffen and G. Levi, editors, Verification, Model Checking, and Abstract Interpretation, 5th International Conference, volume 2937 of Lecture Notes in Computer Science, pages 239-251. Springer, 2004.
11. F. Ramsey. On a problem of formal logic. In Proceedings London Mathematical Society, volume 30, pages 264-286, 1930.
12. R. Thiemann and J. Giesl. Size-change termination for term rewriting. In Proceedings of the 14th International Conference on Rewriting Techniques and Applications (RTA-03), volume 2706 of Lecture Notes in Computer Science, pages 264-278. Springer-Verlag, 2003.
13. D. Wahlstedt. Detecting termination using size-change in parameter values. Master's thesis, Göteborgs Universitet, 2000. http://www.cs. chalmers.se/~davidw/.