Johannes Waldmann

47 papers A 2B 2C 3Journal 17Unranked 21

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