4 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…
The 19th International Workshop on Termination (WST 2023): Preface, Invited Talk Abstract, and Tool Descriptions
Akihisa Yamada, Benjamin Lucien Kaminski, Dieter Hofbauer +2
This report contains the proceedings of the 19th International Workshop on Termination (WST 2023), which was held in Obergurgl during August 24--25 as part of Obergurgl Summer on R…
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…
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…