Johannes Waldmann

Publication Activity (10 Years)

Years Active: 1998-2023
Publications (10 Years): 10

Top Venues

CoRR

RTA

WLP/WFLP

KDPD

University of Jena, Germany (PHD)

Education History

University of Jena, Germany

PHD

Publications

Dieter Hofbauer, Johannes Waldmann
Old and New Benchmarks for Relative Termination of String Rewrite Systems. CoRR (2023)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann
Sparse Tiling through Overlap Closures for Termination of String Rewriting. CoRR (2020)
Dennis Renz, Sibylle Schwarz, Johannes Waldmann
Check Your (Students') Proofs-With Holes. CoRR (2020)
Jürgen Giesl, Albert Rubio, Christian Sternagel, Johannes Waldmann, Akihisa Yamada
The Termination and Complexity Competition. TACAS (3) (2019)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann
Sparse Tiling Through Overlap Closures for Termination of String Rewriting. FSCD (2019)
Johannes Waldmann
When You Should Use Lists in Haskell (Mostly, You Should Not). CoRR (2018)
Johannes Waldmann
Automatische Erzeugung und Bewertung von Aufgaben zu Algorithmen und Datenstrukturen(Generating and Grading Exercises on Algorithms and Data Structures Automatically). ABP (2017)
Johannes Waldmann
Efficient Completion of Weighted Automata. TERMGRAPH (2016)
Johannes Waldmann
Matrix Interpretations on Polyhedral Domains. RTA (2015)
Jürgen Giesl, Frédéric Mesnard, Albert Rubio, René Thiemann, Johannes Waldmann
Termination Competition (termCOMP 2015). CADE (2015)
Johannes Waldmann
Automated Exercises for Constraint Programming. WLP/WFLP (2014)
Alexander Bau, Johannes Waldmann
Describing and Measuring the Complexity of SAT encodings for Constraint Programs. WLP/WFLP (2014)
Alexander Bau, Markus Lohrey, Eric Nöth, Johannes Waldmann
Compression of Rewriting Systems for Termination Analysis. RTA (2013)
Alexander Bau, Johannes Waldmann
Propositional Encoding of Constraints over Tree-Shaped Data. KDPD (2013)
Alexander Bau, Johannes Waldmann
Propositional Encoding of Constraints over Tree-Shaped Data CoRR (2013)
Michael Codish, Yoav Fekete, Carsten Fuhs, Jürgen Giesl, Johannes Waldmann
Exotic Semi-Ring Constraints. SMT@IJCAR (2012)
Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl
Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. CAI (2011)
Johannes Waldmann
Polynomially Bounded Matrix Interpretations. RTA (2010)
Jörg Endrullis, Roel C. de Vrijer, Johannes Waldmann
Local Termination: theory and practice Log. Methods Comput. Sci. 6 (3) (2010)
Adam Koprowski, Johannes Waldmann
Max/Plus Tree Automata for Termination of Term Rewriting. Acta Cybern. 19 (2) (2009)
Jörg Endrullis, Roel C. de Vrijer, Johannes Waldmann
Local Termination. RTA (2009)
Johannes Waldmann
Automatic Termination. RTA (2009)
Andreas Gebhardt, Johannes Waldmann
Weighted Automata Define a Hierarchy of Terminating String Rewriting Systems. Acta Cybern. 19 (2) (2009)
Adam Koprowski, Johannes Waldmann
Arctic Termination ...Below Zero. RTA (2008)
Georg Moser, Andreas Schnabl, Johannes Waldmann
Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. FSTTCS (2008)
Jörg Endrullis, Johannes Waldmann, Hans Zantema
Matrix Interpretations for Proving Termination of Term Rewriting. J. Autom. Reason. 40 (2-3) (2008)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
On tree automata that certify termination of left-linear term rewriting systems. Inf. Comput. 205 (4) (2007)
Hans Zantema, Johannes Waldmann
Termination by Quasi-periodic Interpretations. RTA (2007)
Johannes Waldmann
Weighted Automata for Proving Termination of String Rewriting. J. Autom. Lang. Comb. 12 (4) (2007)
Jörg Endrullis, Johannes Waldmann, Hans Zantema
Matrix Interpretations for Proving Termination of Term Rewriting. IJCAR (2006)
Dieter Hofbauer, Johannes Waldmann
}. Inf. Process. Lett. 98 (4) (2006)
Dieter Hofbauer, Johannes Waldmann
Termination of String Rewriting with Matrix Interpretations. RTA (2006)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. RTA (2005)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
Finding finite automata that certify termination of string rewriting systems. Int. J. Found. Comput. Sci. 16 (3) (2005)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann
Termination Proofs for String Rewriting Systems via Inverse Match-Bounds. J. Autom. Reason. 34 (4) (2005)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema
Finding Finite Automata That Certify Termination of String Rewriting. CIAA (2004)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann
Match-Bounded String Rewriting Systems. Appl. Algebra Eng. Commun. Comput. 15 (3-4) (2004)
Dieter Hofbauer, Johannes Waldmann
Deleting string rewriting systems preserve regularity. Theor. Comput. Sci. 327 (3) (2004)
Johannes Waldmann
Matchbox: A Tool for Match-Bounded String Rewriting. RTA (2004)
Dieter Hofbauer, Johannes Waldmann
Deleting String Rewriting Systems Preserve Regularity. Developments in Language Theory (2003)
Alfons Geser, Dieter Hofbauer, Johannes Waldmann
Match-Bounded String Rewriting Systems. MFCS (2003)
Johannes Waldmann
Rewrite Games. RTA (2002)
Gundula Niemann, Johannes Waldmann
Some Regular Languages That Are Church-Rosser Congruential. Developments in Language Theory (2001)
Johannes Waldmann
The Combinator S. Inf. Comput. 159 (1-2) (2000)
Johannes Waldmann
Normalization of S-Terms is Decidable. RTA (1998)

Johannes Waldmann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Johannes Waldmann