Program Termination Analysis in Polynomial Time-Reference-Cited by-同舟云学术

Program Termination Analysis in Polynomial Time

Published:2002 Issue: Volume: Page:218-235
ISSN:0302-9743
Container-title:Generative Programming and Component Engineering
language:
Short-container-title:

Author:

Lee Chin Soon

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45821-2_14

Reference15 articles.

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. Lect Notes Comput Sci;M. Codish,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 .

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sub-Computation Based Transition Predicate Abstraction;IPSJ Digital Courier;2007

2. Size-Change Termination and Bound Analysis;Functional and Logic Programming;2006

3. The size-change principle and dependency pairs for termination of term rewriting;Applicable Algebra in Engineering, Communication and Computing;2005-06-22

4. Termination Analysis of the Untyped λ-Calculus;Rewriting Techniques and Applications;2004

5. Affine-Based Size-Change Termination;Programming Languages and Systems;2003