Certification of Termination Proofs Using CeTA-Reference-Cited by-同舟云学术

Certification of Termination Proofs Using CeTA

Published:2009 Issue: Volume: Page:452-468
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Thiemann René,Sternagel Christian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-03359-9_31

Reference18 articles.

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

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

3. Blanqui, F., Delobel, W., Coupet-Grimal, S., Hinderer, S., Koprowski, A.: CoLoR, a Coq library on rewriting and termination. In: Proc. WST 2006, pp. 69–73 (2006)

4. Lecture Notes in Computer Science;E. Contejean,2007

5. Contejean, E., Marché, C., Monate, B., Urbain, X.: C i ME, http://cime.lri.fr

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

1. Linear Resources in Isabelle/HOL;Journal of Automated Reasoning;2024-05-18

2. Certification of Confluence- and Commutation-Proofs via Parallel Critical Pairs;Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs;2024-01-09

3. Formally Certified Approximate Model Counting;Lecture Notes in Computer Science;2024

4. From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting;Lecture Notes in Computer Science;2024

5. First-Order Theory of Rewriting for Linear Variable-Separated Rewrite Systems: Automation, Formalization, Certification;Journal of Automated Reasoning;2023-04-06