WST 2025 accepted papers

  • Ulysse Le Huitouze and René Thiemann

    Core matrix interpretations for proving termination of term rewrite systems

  • Etienne Payet

    Non-Termination of Term Rewrite Systems Using Pattern Unfolding information on submission

  • Nils Lommen, Éléanore Meyer and Jürgen Giesl

    Control-Flow Refinement for Complexity Analysis of Probabilistic Programs

  • Nils Lommen, Éléanore Meyer and Jürgen Giesl

    KoAT: An Automatic Complexity Analysis Tool for (Probabilistic) Integer Programs

  • Éléanore Meyer and Jürgen Giesl

    Deciding Termination of Simple Randomized Loops

  • Johannes Niederhauser and Aart Middeldorp

    NCPO goes Beta-Eta-Long Normal Form

  • Jan-Christoph Kassing, Grigory Vartanyan and Jürgen Giesl

    A Dependency Pair Framework for Relative Termination of Term Rewriting

  • Florian Frohn, Carsten Fuhs, Jürgen Giesl, Jan-Christoph Kassing and Nils Lommen

    AProVE: Becoming Open Source and Recent Improvements

  • Jan-Christoph Kassing and Jürgen Giesl

    Modularity of Termination in Probabilistic Term Rewriting

  • René Thiemann

    A New Proof for Soundness of Right-Forward Closures for Termination Analysis

  • Vincent van Oostrom

    Disjunctive Termination for Affluent Families

  • Dieter Hofbauer and Johannes Waldmann

    Cetera: Certified Termination with Agda

  • Raúl Gutiérrez and Salvador Lucas

    MU-TERM GTRS: A Tool for Proving Termination of Generalized Term Rewriting Systems

  • Carsten Fuhs, Liye Guo and Cynthia Kop

    DPs for Innermost Constrained Higher-Order Rewriting

  • Reinis Cirpons, James D. Mitchell and Finn L. Smith

    Off with the head: termination provers and the word problem for 1-relation monoids