19th International Workshop on Termination

August 24-25, 2023, University Center Obergurgl, Austria. Co-located with IWC 2023.

Registration is open at OSR 2023 website!

Background

The Workshop on Termination (WST) 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.). The friendly atmosphere enables fruitful exchanges leading to joint research and subsequent publications.

The 19th International Workshop on Termination (WST 2023) continues the successful workshops held in St. Andrews (1993), La Bresse (1995), Ede (1997), Dagstuhl (1999), Utrecht (2001), Valencia (2003), Aachen (2004), Seattle (2006), Paris (2007), Leipzig (2009), Edinburgh (2010), Obergurgl (2012), Bertinoro (2013), Vienna (2014), Obergurgl (2016), Oxford (2018), virtually (2021), and Haifa (2022).

Workshop Topics

The 19th International Workshop on Termination welcomes contributions on all aspects of termination. In particular, papers investigating applications of termination (for example in complexity analysis, program analysis and transformation, theorem proving, program correctness, modeling computational systems, etc.) are very welcome.

Topics of interest include (but are not limited to):

• termination and complexity analysis in any domain (lambda calculus, declarative programming, rewriting, transition systems, probabilistic programs, etc.)
• abstraction methods in termination analysis
• certification of termination and complexity proofs
• challenging termination problems
• comparison and classification of termination methods
• implementation of termination and complexity methods
• non-termination analysis and loop detection
• normalization and infinitary normalization
• operational termination of logic-based systems
• ordinal notation and subrecursive hierarchies
• SAT, SMT, and constraint solving for (non-)termination analysis
• scalability and modularity of termination methods
• well-founded relations and well-quasi-orders

Termination Competition

Since 2003, the catalytic effect of WST to stimulate new research on termination has been enhanced by the celebration of the Termination_Competition and its continuously developing problem databases containing thousands of programs as challenges for termination analysis in different categories. In 2023, the Termination Competition will run shortly before WST. Tool/benchmark authors are invited to submit a short tool paper and give a presentation on the workshop.

Keynote Speaker

• Benjamin Kaminski, Saarland U.

Accepted Papers

• Ayuka Matsumi, Naoki Nishida, Misaki Kojima and Donghoon Shin. On Singleton Self-Loop Removal for Termination of LCTRSs with Bit-Vector Arithmetic
• Teppei Saito and Nao Hirokawa. Generalizing Weighted Path Orders
• Nils Lommen, Eleanore Meyer and Jürgen Giesl. Automated Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
• Florian Frohn and Jürgen Giesl. Proving Non-Termination by Acceleration Driven Clause Learning
• Etienne Payet. Binary Non-Termination in Term Rewriting and Logic Programming
• René Thiemann and Elias Wenninger. A Verified Efficient Implementation of the Weighted Path Order
• Jan-Christoph Kassing and Jürgen Giesl. Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
• Jera Hensel and Jürgen Giesl. Automated Termination Proofs for C Programs with Lists
• Liye Guo and Cynthia Kop. Higher-Order LCTRSs and Their Termination
• Nao Hirokawa and Aart Middeldorp. Hydra Battles and AC Termination, Revisited
• Dieter Hofbauer and Johannes Waldmann. Old and New Benchmarks for Relative Termination of String Rewrite Systems
• Fabian Mitterwallner, Aart Middeldorp and René Thiemann. Linear Termination over N is Undecidable
• Cynthia Kop and Deivid Vale. Complexity Analysis for Call-by-Value Higher-Order Rewriting

Submission Guidelines

Submissions are short papers/extended abstracts which should not exceed 5 pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and provides additional feedback for each submission. The accepted papers will be made available electronically before the workshop.

Papers should be submitted electronically via the submission page.

Please use LaTeX and the LIPIcs style file to prepare your submission.

Important Dates

• title and abstract submission: June 1
• paper submission: June 8
• notification: June 15
• final version: July 27
• workshop: August 24-25

Program Committee

• Martin Avanzini, INRIA Sophia Antipolis
• Florian Frohn, RWTH Aachen
• Carsten Fuhs, Birkbeck, U. London
• Raúl Gutiérrez, U. Politécnica de Madrid
• Étienne Payet, U. La Réunion
• Albert Rubio, Complutense U. Madrid
• René Thiemann, U. Innsbruck
• Deivid Vale, Radboud U. Nijmegen
• Johannes Waldmann, HTWK Leipzig
• Akihisa Yamada, AIST Tokyo Waterfront (chair)