7 citations found. Retrieving documents...
N. Hirokawa and A. Middeldorp. Tsukuba termination tool. In Proc. 14th RTA, LNCS 2706, pages 311--320, 2003.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Improving Dependency Pairs - Giesl, Thiemann, Schneider-Kamp.. (2003)   (Correct)

....termination prover AProVE. We give empirical results which show that they are extremely successful in practice. Details on our experiments can be found in the appendix. Thus, the contributions of this paper are also very helpful for other tools based on dependency pairs (e.g. 1] CiME [6] TTT [14, 15], TALP [24] Moreover, we conjecture that they can also be used in other recent approaches for termination [5, 10] which have several aspects in common with dependency pairs. 2 Dependency Pairs We briefly present the dependency pair approach of Arts and Giesl and refer to [2, 11, 12] for ....

....considers cycles or if one only uses Urbain s modularity result [29] then Ex. 10 fails with simplification orders. Instead, both refinements should be combined as in Thm. 9. That this combination is not completely straightforward is demonstrated by the fact that recent powerful systems like TTT [14, 15] feature only one of these refinements (TTT only considers cycles as in Thm. 8) 4 Improved Innermost Termination Proofs Proving innermost termination with dependency pairs is easier than proving termination for two reasons: The innermost dependency graph has less arcs than the dependency graph ....

N. Hirokawa and A. Middeldorp. Tsukuba termination tool. In Proc. 14th RTA, LNCS, 2003. To appear.


Improving Dependency Pairs - Giesl, Thiemann, Schneider-Kamp.. (2003)   (Correct)

No context found.

N. Hirokawa and A. Middeldorp. Tsukuba termination tool. In Proc. 14th RTA, LNCS 2706, pages 311--320, 2003.


Mechanizing Dependency Pairs - Giesl, Thiemann, Schneider-Kamp.. (2003)   (Correct)

No context found.

N. Hirokawa and A. Middeldorp. Tsukuba termination tool. In Proc. 14th RTA, pages 311--320, 2003. LNCS 2706.


Improving Dependency Pairs - Giesl, Thiemann, Schneider-Kamp.. (2003)   (Correct)

No context found.

N. Hirokawa and A. Middeldorp. Tsukuba termination tool. In Proc. 14th RTA, LNCS 2706, pages 311--320, 2003.


Automated Termination Proofs with AProVE - Giesl, Thiemann, Schneider-Kamp, .. (2004)   (4 citations)  (Correct)

No context found.

N. Hirokawa and A. Middeldorp. Tsukuba termination tool. In Proc. 14th RTA, LNCS 2706, pages 311--320, 2003.


Improved Modular Termination Proofs Using Dependency Pairs - Thiemann, Giesl.. (2004)   (Correct)

No context found.

N. Hirokawa and A. Middeldorp. Tsukuba termination tool. In R. Nieuwenhuis, editor, Proc. 14th RTA, LNCS 2706, pages 311--320, Valencia, Spain, 2003.


Modular & Incremental Automated Termination Proofs - Urbain (2004)   (Correct)

No context found.

Hirokawa, N. and A. Middeldorp: 2003, `Tsukuba Termination Tool'. In: R. Nieuwenhuis (ed.): 14th International Conference on Rewriting Techniques and Applications, Vol. 2706 of Lecture Notes in Computer Science. Valencia, Spain, pp. 311--320.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC