Johannes Waldmann

发表

Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations

Georg Moser, Andreas Schnabl, Johannes Waldmann, 2008, FSTTCS.

Matrix Interpretations on Polyhedral Domains

Johannes Waldmann, 2015, RTA.

Matrix Interpretations for Proving Termination of Term Rewriting

Hans Zantema, Jörg Endrullis, Johannes Waldmann, 2006, IJCAR.

Some Regular Languages That Are Church-Rosser Congruential

Johannes Waldmann, Gundula Niemann, Gundula Niemann, 2001, Developments in Language Theory.

Exotic Semi-Ring Constraints

Jürgen Giesl, Carsten Fuhs, Michael Codish, 2013, SMT@IJCAR.

Propositional Encoding of Constraints over Tree-Shaped Data pdf

Johannes Waldmann, Alexander Bau, Johannes Waldmann, 2013, KDPD.

Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems

Georg Moser, Aart Middeldorp, Friedrich Neurauter, 2011, CAI.

Local Termination

Jörg Endrullis, Johannes Waldmann, Roel C. de Vrijer, 2009, RTA.

Termination by Quasi-periodic Interpretations

Hans Zantema, Johannes Waldmann, 2007, RTA.

Tree automata that certify termination of term rewriting systems

Hans Zantema, Alfons Geser, Johannes Waldmann, 2004 .

Rewrite Games

Johannes Waldmann, J. Waldmann, Johannes Waldmann, 2002, RTA.

Finding Finite Automata That Certify Termination of String Rewriting

Hans Zantema, Dieter Hofbauer, Alfons Geser, 2004, CIAA.

Deleting String Rewriting Systems Preserve Regularity

Dieter Hofbauer, Johannes Waldmann, 2003, Developments in Language Theory.

Termination Competition (termCOMP 2015)

Albert Rubio, Jürgen Giesl, Frédéric Mesnard, 2015, CADE.

On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems

Hans Zantema, Dieter Hofbauer, Alfons Geser, 2005, RTA.

The Combinator S

Johannes Waldmann, Johannes Waldmann, 2000, Inf. Comput..

Polynomially Bounded Matrix Interpretations

Johannes Waldmann, Johannes Waldmann, 2010, RTA.

Check Your (Students') Proofs-With Holes pdf

Johannes Waldmann, Sibylle Schwarz, Dennis Renz, 2020, ArXiv.

Match-Bounded String Rewriting Systems

Dieter Hofbauer, Alfons Geser, Johannes Waldmann, 2003, MFCS.

Arctic Termination ...Below Zero

Johannes Waldmann, Adam Koprowski, A. Koprowski, 2008, RTA.

Deleting string rewriting systems preserve regularity

Dieter Hofbauer, Johannes Waldmann, D. Hofbauer, 2004, Theor. Comput. Sci..

The Termination and Complexity Competition

Albert Rubio, Jürgen Giesl, Christian Sternagel, 2019, TACAS.

Automated Exercises for Constraint Programming

Johannes Waldmann, Johannes Waldmann, 2014, WLP/WFLP.

On tree automata that certify termination of left-linear term rewriting systems

Hans Zantema, Dieter Hofbauer, Alfons Geser, 2005, Inf. Comput..

Describing and Measuring the Complexity of SAT encodings for Constraint Programs

Johannes Waldmann, Alexander Bau, 2014, WLP/WFLP.

Decomposing terminating rewrite relations

Jörg Endrullis, Johannes Waldmann, D. Hofbauer, 2006 .

Max/Plus Tree Automata for Termination of Term Rewriting

Johannes Waldmann, Adam Koprowski, 2009, Acta Cybern..

Termination of {aa->bc, bb->ac, cc->ab}

Dieter Hofbauer, Johannes Waldmann, 2006, Inf. Process. Lett..

Termination Proofs for String Rewriting Systems via Inverse Match-Bounds

Dieter Hofbauer, Alfons Geser, Johannes Waldmann, 2005, Journal of Automated Reasoning.

Automatische Erzeugung und Bewertung von Aufgaben zu Algorithmen und Datenstrukturen(Generating and Grading Exercises on Algorithms and Data Structures Automatically)

Johannes Waldmann, 2017, ABP.

Matrix Interpretations for Proving Termination of Term Rewriting

Hans Zantema, Jörg Endrullis, Johannes Waldmann, 2006, Journal of Automated Reasoning.

Weighted Automata for Proving Termination of String Rewriting

Johannes Waldmann, 2007, J. Autom. Lang. Comb..

Matchbox: A Tool for Match-Bounded String Rewriting

Johannes Waldmann, 2004, RTA.

Efficient Completion of Weighted Automata

Johannes Waldmann, 2016, TERMGRAPH.

Compression of Rewriting Systems for Termination Analysis

Markus Lohrey, Johannes Waldmann, Alexander Bau, 2013, RTA.

13th International Workshop on Termination (WST 2013)

Marc Brockschmidt, Fabian Emmes, Carsten Fuhs, 2013 .

Termination of String Rewriting with Matrix Interpretations

Dieter Hofbauer, Johannes Waldmann, 2006, RTA.

Finding finite automata that certify termination of string rewriting systems

Hans Zantema, Dieter Hofbauer, Alfons Geser, 2005, Int. J. Found. Comput. Sci..

Local Termination: theory and practice

Jörg Endrullis, Johannes Waldmann, Roel C. de Vrijer, 2010, Log. Methods Comput. Sci..

Normalization of S-Terms is Decidable

Johannes Waldmann, 1998, RTA.

Match-Bounded String Rewriting Systems

Dieter Hofbauer, Alfons Geser, Johannes Waldmann, 2003, Applicable Algebra in Engineering, Communication and Computing.

Weighted Automata Define a Hierarchy of Terminating String Rewriting Systems

Johannes Waldmann, Andreas Gebhardt, 2009, Acta Cybern..

When You Should Use Lists in Haskell (Mostly, You Should Not) pdf

Johannes Waldmann, Johannes Waldmann, 2018, ArXiv.

Sparse Tiling Through Overlap Closures for Termination of String Rewriting

Dieter Hofbauer, Alfons Geser, Johannes Waldmann, 2019, FSCD.

Automatic Termination

Johannes Waldmann, 2009, RTA.

Exotic Semiring Constraints ( Extended Abstract )

Jürgen Giesl, Carsten Fuhs, Michael Codish, 2012 .

Dance of the Starlings

Jan Willem Klop, Henk Barendregt, Jörg Endrullis, 2017 .

Report on the Termination Competition 2008

Johannes Waldmann, 2009 .

Deciding Termination for Ancestor Match- Bounded String Rewriting Systems

Dieter Hofbauer, Alfons Geser, Johannes Waldmann, 2005 .

Exotic Semiring Constraints

Michael Codish, Johannes Waldmann, 2012 .