Certifying a Termination Criterion Based on Graphs, without Graphs-Reference-Cited by-同舟云学术

Certifying a Termination Criterion Based on Graphs, without Graphs

Published:2008 Issue: Volume: Page:183-198
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Courtieu Pierre,Forest Julien,Urbain Xavier

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-71067-7_17

Reference21 articles.

1. Lecture Notes in Computer Science;T. Arts,1997

2. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133–178 (2000)

3. Arts, T., Giesl, J.: A collection of examples for termination of term rewriting using dependency pairs. Technical report, RWTH Aachen (September 2001)

4. Arts, T., Giesl, J.: Verification of Erlang Processes by Dependency Pairs. Application Algebra in Engineering, Communication and Computing 12(1,2), 39–72 (2001)

5. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

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

1. CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates;Mathematical Structures in Computer Science;2011-07-01

2. Automated Certified Proofs with CiME3;LEIBNIZ INT PR INFOR;2011

3. A3PAT, an approach for certified automated termination proofs;Proceedings of the ACM SIGPLAN 2010 workshop on Partial evaluation and program manipulation - PEPM '10;2010

4. Improved Matrix Interpretation;SOFSEM 2010: Theory and Practice of Computer Science;2010

5. Certification of Termination Proofs Using CeTA;Lecture Notes in Computer Science;2009