Back to Results
First PageMeta Content
Theoretical computer science / Mathematics / Mathematical logic / Logic in computer science / Rewriting / Termination analysis / International Conference on Rewriting Techniques and Applications / Algorithm / Dependency graph / Path ordering / Polynomial


Automated Termination Proofs with AProVE? J¨ urgen Giesl, Ren´e Thiemann, Peter Schneider-Kamp, Stephan Falke LuFG Informatik II, RWTH Aachen, Ahornstr. 55, 52074 Aachen, Germany {giesl|thiemann|psk}@informatik.rwth-aa
Add to Reading List

Document Date: 2006-07-26 07:36:55

Open Document

File Size: 384,33 KB

Share Result on Facebook