Proving Termination of Rewrite Systems Using Bounds. - Martin Korp; Aart Middeldorp (RTA, 2007)

Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems. - Martin Korp; Aart Middeldorp (LATA, 2008)

Beyond Dependency Graphs. - Martin Korp; Aart Middeldorp (CADE, 2009)

Tyrolean Termination Tool 2. - Martin Korp; Christian Sternagel; Harald Zankl; Aart Middeldorp (RTA, 2009)

Match-bounds revisited. - Martin Korp; Aart Middeldorp (Inf. Comput., 2009)

On Implementing Modular Complexity Analysis. - Harald Zankl; Martin Korp (IWIL@LPAR, 2010)

Modular Complexity Analysis via Relative Complexity. - Harald Zankl; Martin Korp (RTA, 2010)

Modular Complexity Analysis for Term Rewriting. - Harald Zankl; Martin Korp (Log. Methods Comput. Sci., 2014)