Author:
Giesl Jürgen,Thiemann René,Schneider-Kamp Peter,Falke Stephan
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Lecture Notes in Computer Science;T. Arts,2000
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 AIB-2001-093, RWTH Aachen (2001)
4. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambr. Univ. Pr., Cambridge (1998)
5. Lecture Notes in Computer Science;C. Borralleras,2000
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Proving weak properties of rewriting;Theoretical Computer Science;2011-08
2. 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
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. Match-bounds revisited;Information and Computation;2009-11
5. Analysis of Rewrite-Based Access Control Policies;Electronic Notes in Theoretical Computer Science;2009-03