Tyrolean Termination Tool 2-Reference-Cited by-同舟云学术

Tyrolean Termination Tool 2

Published:2009 Issue: Volume: Page:295-304
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Korp Martin,Sternagel Christian,Zankl Harald,Middeldorp Aart

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02348-4_21

Reference26 articles.

1. Lecture Notes in Computer Science;B. Dutertre,2006

2. Lecture Notes in Computer Science;N. Eén,2004

3. Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of rewrite systems. Journal of Automated Reasoning 40(2-3), 195–220 (2008)

4. Lecture Notes in Computer Science;C. Fuhs,2008

5. Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: On tree automata that certify termination of left-linear term rewriting systems. Information and Computation 205(4), 512–534 (2007)

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

1. Finite Automata synthesis from Interactions;Proceedings of the 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE);2024-04-14

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. A Dependency Pair Framework for Relative Termination of Term Rewriting;Lecture Notes in Computer Science;2024

4. Denotational and operational semantics for interaction languages: Application to trace analysis;Science of Computer Programming;2024-01

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