9 citations · 13 across the 8 of their papers we have counts for
8 papers
Semantic Labelling in Practice
Dieter Hofbauer, Johannes Waldmann
Automating semantic labelling for termination proofs is a combinatorially hard problem since the number of algebras grows prohibitively large even for small domains. We report on e…
Old and New Benchmarks for Relative Termination of String Rewrite Systems
Dieter Hofbauer, Johannes Waldmann
We provide a critical assessment of the current set of benchmarks for relative SRS termination in the Termination Problems Database (TPDB): most of the benchmarks in Waldmann_19 an…
Check Your (Students') Proofs-With Holes
Dennis Renz, Sibylle Schwarz, Johannes Waldmann
Cyp (Check Your Proofs) (Durner and Noschinski 2013; Traytel 2019) verifies proofs about Haskell-like programs. We extended Cyp with a pattern matcher for programs and proof terms,…
Sparse Tiling through Overlap Closures for Termination of String Rewriting
Alfons Geser, Dieter Hofbauer, Johannes Waldmann
We over-approximate reachability sets in string rewriting by languages defined by admissible factors, called tiles. A sparse set of tiles contains only those that are reachable in…
When You Should Use Lists in Haskell (Mostly, You Should Not)
Johannes Waldmann
We comment on the over-use of lists in functional programming. With this respect, we review history of Haskell and some of its libraries, and hint at current developments.
Efficient Completion of Weighted Automata
Johannes Waldmann
We consider directed graphs with edge labels from a semiring. We present an algorithm that allows efficient execution of queries for existence and weights of paths, and allows upda…