Maximal Termination-Reference-Cited by-同舟云学术

Maximal Termination

Published: Issue: Volume: Page:110-125
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Fuhs Carsten,Giesl Jürgen,Middeldorp Aart,Schneider-Kamp Peter,Thiemann René,Zankl Harald

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-70590-1_8.pdf

Reference18 articles.

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

2. Lecture Notes in Computer Science;C. Fuhs,2007

3. Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: Maximal termination. Technical Report AIB-2008-03, RWTH Aachen, Germany (2008), http://aib.informatik.rwth-aachen.de

4. Lecture Notes in Artificial Intelligence;J. Giesl,2005

5. Lecture Notes in Artificial Intelligence;J. Giesl,2006

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

1. Tuple Interpretations for Termination of Term Rewriting;Journal of Automated Reasoning;2022-07-25

2. Analysing Parallel Complexity of Term Rewriting;Logic-Based Program Synthesis and Transformation;2022

3. Multi-Dimensional Interpretations for Termination of Term Rewriting;Automated Deduction – CADE 28;2021

4. Transforming Dependency Chains of Constrained TRSs into Bounded Monotone Sequences of Integers;Electronic Proceedings in Theoretical Computer Science;2018-02-16

5. Automating sized-type inference for complexity analysis;Proceedings of the ACM on Programming Languages;2017-08-29