- Titel
- 20th International Workshop on Termination
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:l189-qucosa2-1003187
- Konferenz
- 20th International Workshop on Termination. Leipzig, September 3-4, 2025
- Erstveröffentlichung
- 2025
- DOI
- https://doi.org/10.33968/2025.48
- Abstract (EN)
- This report contains the proceedings of the 20th International Workshop on Termination (WST 2025), which was held in Leipzig, Germany, during September 3–4, co-located with the 14th International Workshop on Confluence (IWC 2025), September 2–3. The Workshop on Termination traditionally brings together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop also provides a ground for cross-fertilization of ideas from the different communities interested in termination (e.g., working on computational mechanisms, programming languages, software engineering, constraint solving, etc.).
- Freie Schlagwörter (EN)
- 20th International Workshop on Termination
- HerausgeberIn
- Dieter Hofbauer
- Johannes Waldmann
- Herausgeber (Institution)
- Hochschule für Technik, Wirtschaft und Kultur Leipzig, Leipzig
- Version / Begutachtungsstatus
- publizierte Version / Verlagsversion
- URN Qucosa
- urn:nbn:de:bsz:l189-qucosa2-1003187
- Veröffentlichungsdatum Qucosa
- 13.11.2025
- Dokumenttyp
- Konferenzband
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY-NC-ND 4.0- Inhaltsverzeichnis
Aart Middeldorp (joint invited talk IWC and WST): Termination and Confluence: Remembering Hans Zantema 1 Ulysse Le Huitouze, René Thiemann: Core Matrix Interpretations for Proving Termination of Term Rewrite Systems 2 Reinis Cirpons, James D. Mitchell, Finn L. Smith: Off with the Head: Termination Provers and the Word Problem for 1-Relation Monoids 10 Carsten Fuhs, Liye Guo, Cynthia Kop: Dependency Pairs for Innermost Constrained Higher-Order Rewriting 17 Johannes Niederhauser, Aart Middeldorp: NCPO goes Beta-Eta-Long Normal Form 24 Vincent van Oostrom: Disjunctive Termination for Affluent Families 30 Etienne Payet: Non-Termination of Term Rewrite Systems Using Pattern Unfolding 35 Jan-Christoph Kassing, Grigory Vartanyan, Jürgen Giesl: A Dependency Pair Framework for Relative Termination of Term Rewriting 40 Jan-Christoph Kassing, Jürgen Giesl: Modularity of Termination in Probabilistic Term Rewriting 42 Éléanore Meyer, Jürgen Giesl: Deciding Termination of Simple Randomized Loops 47 Nils Lommen, Éléanore Meyer, Jürgen Giesl: Control-Flow Refinement for Complexity Analysis of Probabilistic Programs 52 Alfons Geser: On Closures in String Rewriting 57 René Thiemann: A New Proof for Soundness of Right-Forward Closures for Termination Analysis 63 Dieter Hofbauer, Johannes Waldmann: Cetera: Certified Termination with Agda 70 Raúl Gutiérrez, Salvador Lucas: MU-TERM GTRS: A Tool for Proving Termination of Generalized Term Rewriting Systems 73 Florian Frohn, Carsten Fuhs, Jürgen Giesl, Jan-Christoph Kassing, Nils Lommen: AProVE: Becoming Open Source and Recent Improvements 79 Nils Lommen, Éléanore Meyer, Jürgen Giesl: KoAT: An Automatic Complexity Analysis Tool for (Probabilistic) Integer Programs 81