Improving Context-Sensitive Dependency Pairs. - Beatriz Alarcón; Fabian Emmes; Carsten Fuhs; Jürgen Giesl; Raúl Gutiérrez; Salvador Lucas; Peter Schneider-Kamp; René Thiemann (LPAR, 2008)

A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems. - Lars Noschinski; Fabian Emmes; Jürgen Giesl (CADE, 2011)

A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog. - Thomas Ströder; Fabian Emmes; Peter Schneider-Kamp; Jürgen Giesl; Carsten Fuhs (LOPSTR, 2011)

Proving Non-looping Non-termination Automatically. - Fabian Emmes; Tim Enger; Jürgen Giesl (IJCAR, 2012)

Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs. - Jürgen Giesl; Thomas Ströder; Peter Schneider-Kamp; Fabian Emmes; Carsten Fuhs (LOPSTR, 2012)

Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs. - Lars Noschinski; Fabian Emmes; Jürgen Giesl (J. Autom. Reason., 2013)

Proving Termination of Programs Automatically with AProVE. - Jürgen Giesl; Marc Brockschmidt; Fabian Emmes; Florian Frohn; Carsten Fuhs; Carsten Otto; Martin Plücker; Peter Schneider-Kamp; Thomas Ströder; Stephanie Swiderski; René Thiemann (IJCAR, 2014)

Alternating Runtime and Size Complexity Analysis of Integer Programs. - Marc Brockschmidt; Fabian Emmes; Stephan Falke 001; Carsten Fuhs; Jürgen Giesl (TACAS, 2014)

Analyzing Runtime and Size Complexity of Integer Programs. - Marc Brockschmidt; Fabian Emmes; Stephan Falke 001; Carsten Fuhs; Jürgen Giesl (ACM Trans. Program. Lang. Syst., 2016)

Analyzing Program Termination and Complexity Automatically with AProVE. - Jürgen Giesl; Cornelius Aschermann; Marc Brockschmidt; Fabian Emmes; Florian Frohn; Carsten Fuhs; Jera Hensel; Carsten Otto; Martin Plücker; Peter Schneider-Kamp; Thomas Ströder; Stephanie Swiderski; et al. (J. Autom. Reason., 2017)