Johannes Waldmann

According to our database, Johannes Waldmann authored at least 40 papers between 1998 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Old and New Benchmarks for Relative Termination of String Rewrite Systems.

Dieter Hofbauer, Johannes Waldmann

CoRR, 2023

2020

Check Your (Students') Proofs-With Holes.

Dennis Renz, Sibylle Schwarz, Johannes Waldmann

CoRR, 2020

2019

The Termination and Complexity Competition.

Jürgen Giesl, Albert Rubio, Christian Sternagel, Johannes Waldmann, Akihisa Yamada

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

Sparse Tiling Through Overlap Closures for Termination of String Rewriting.

Alfons Geser, Dieter Hofbauer, Johannes Waldmann

Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

2018

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

Johannes Waldmann

CoRR, 2018

2017

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

Johannes Waldmann

Proceedings of the Third Workshop "Automatische Bewertung von Programmieraufgaben" (ABP 2017), 2017

2016

Efficient Completion of Weighted Automata.

Johannes Waldmann

Proceedings of the Proceedings 9th International Workshop on Computing with Terms and Graphs, 2016

2015

Matrix Interpretations on Polyhedral Domains.

Johannes Waldmann

Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Termination Competition (termCOMP 2015).

Jürgen Giesl, Frédéric Mesnard, Albert Rubio, René Thiemann, Johannes Waldmann

Proceedings of the Automated Deduction - CADE-25, 2015

2014

Automated Exercises for Constraint Programming.

Johannes Waldmann

Proceedings of the 28th Workshop on (Constraint) Logic Programming (WLP 2014) Proceedings of the 23rd International Workshop on Functional and (Constraint) Logic Programming, 2014

Describing and Measuring the Complexity of SAT encodings for Constraint Programs.

Alexander Bau, Johannes Waldmann

Proceedings of the 28th Workshop on (Constraint) Logic Programming (WLP 2014) Proceedings of the 23rd International Workshop on Functional and (Constraint) Logic Programming, 2014

2013

Compression of Rewriting Systems for Termination Analysis.

Alexander Bau, Markus Lohrey, Eric Nöth, Johannes Waldmann

Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

Propositional Encoding of Constraints over Tree-Shaped Data.

Alexander Bau, Johannes Waldmann

Proceedings of the Declarative Programming and Knowledge Management, 2013

2012

Exotic Semi-Ring Constraints.

Michael Codish, Yoav Fekete, Carsten Fuhs, Jürgen Giesl, Johannes Waldmann

Proceedings of the 10th International Workshop on Satisfiability Modulo Theories, 2012

2011

Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems.

Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl

Proceedings of the Algebraic Informatics - 4th International Conference, 2011

2010

Local Termination: theory and practice

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

Log. Methods Comput. Sci., 2010

Polynomially Bounded Matrix Interpretations.

Johannes Waldmann

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

2009

Max/Plus Tree Automata for Termination of Term Rewriting.

Adam Koprowski, Johannes Waldmann

Acta Cybern., 2009

Weighted Automata Define a Hierarchy of Terminating String Rewriting Systems.

Andreas Gebhardt, Johannes Waldmann

Acta Cybern., 2009

Automatic Termination.

Johannes Waldmann

Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

Local Termination.

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

Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

2008

Matrix Interpretations for Proving Termination of Term Rewriting.

Jörg Endrullis, Johannes Waldmann, Hans Zantema

J. Autom. Reason., 2008

Arctic Termination ...Below Zero.

Adam Koprowski, Johannes Waldmann

Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

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

Georg Moser, Andreas Schnabl, Johannes Waldmann

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2007

Weighted Automata for Proving Termination of String Rewriting.

Johannes Waldmann

J. Autom. Lang. Comb., 2007

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

Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema

Inf. Comput., 2007

Termination by Quasi-periodic Interpretations.

Hans Zantema, Johannes Waldmann

Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

2006

Termination of {<i>a</i><i>a</i>-><i>b</i><i>c</i>, <i>b</i><i>b</i>-><i>a</i><i>c</i>, <i>c</i><i>c</i>-><i>a</i><i>b</i>}.

Dieter Hofbauer, Johannes Waldmann

Inf. Process. Lett., 2006

Termination of String Rewriting with Matrix Interpretations.

Dieter Hofbauer, Johannes Waldmann

Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

2005

Termination Proofs for String Rewriting Systems via Inverse Match-Bounds.

Alfons Geser, Dieter Hofbauer, Johannes Waldmann

J. Autom. Reason., 2005

Finding finite automata that certify termination of string rewriting systems.

Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema

Int. J. Found. Comput. Sci., 2005

2004

Deleting string rewriting systems preserve regularity.

Dieter Hofbauer, Johannes Waldmann

Theor. Comput. Sci., 2004

Match-Bounded String Rewriting Systems.

Alfons Geser, Dieter Hofbauer, Johannes Waldmann

Appl. Algebra Eng. Commun. Comput., 2004

Finding Finite Automata That Certify Termination of String Rewriting.

Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema

Proceedings of the Implementation and Application of Automata, 2004

Matchbox: A Tool for Match-Bounded String Rewriting.

Johannes Waldmann

Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004

2002

Rewrite Games.

Johannes Waldmann

Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

2001

Some Regular Languages That Are Church-Rosser Congruential.

Gundula Niemann, Johannes Waldmann

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

2000

The Combinator S.

Johannes Waldmann

Inf. Comput., 2000

1998

The combinator S.

Johannes Waldmann

PhD thesis, 1998

Normalization of S-Terms is Decidable.

Johannes Waldmann

Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998