The Termination and Complexity Competition
Open Access
- 4 April 2019
- book chapter
- Published by Springer Nature
- p. 156-166
Abstract
No abstract availableKeywords
This publication has 44 references indexed in Scilit:
- On Multiphase-Linear Ranking Functions2017
- Proving Termination Through Conditional Termination2017
- A combination framework for complexityInformation and Computation, 2016
- TcT: Tyrolean Complexity Tool2016
- Termination of rewrite relations on λ-terms based on Girard's notion of reducibilityTheoretical Computer Science, 2016
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificatesMathematical Structures in Computer Science, 2011
- Proving Termination Properties with mu-term2011
- Interactive Theorem Proving and Program Development2004
- Termination of term rewriting using dependency pairsTheoretical Computer Science, 2000
- Certification of Complexity Proofs using CeTA