====================================================================== WST 2026 - First Call for Papers 21st International Workshop on Termination https://termination-portal.org/wiki/21st_International_Workshop_on_Terminati...
July 25, 2026, Lisbon, Portugal
Affiliated with IJCAR, July 26-29, 2026 ======================================================================
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 workshop is held as part of the 2026 Federated Logic Conference (FLoC 2026 https://www.floc26.org) and is affiliated with the 13th International Joint Conference on Automated Reasoning (IJCAR 2026 https://www.floc26.org/ijcar).
IMPORTANT DATES
- title and abstract submission: April 28, 2026 - submission: May 5, 2026 - notification: May 26, 2026 - early registration: June 1, 2026 - final version: June 26, 2026 - workshop: July 25, 2026
TOPICS
The 21st 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 - 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
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 through the HotCRP system at:
https://submissions.floc26.org/wst/
Please use LaTeX and the LIPIcs style file from
https://github.com/dagstuhl-publishing/styles/
to prepare your submission.
PROGRAM COMMITTEE
- Florian Frohn, RWTH Aachen University (co-chair) - Raúl Gutiérrez, Universitat Politècnica de València - Dieter Hofbauer, ASW Saarland - Nils Lommen, RWTH Aachen University - Johannes Niederhauser, University of Innsbruck - Vincent van Oostrom, University of Sussex - Étienne Payet, Université de La Réunion (co-chair) - Hiroshi Unno, Tohoku University - Wim Vanhoof, Université de Namur - Dragana Milovancevic, Imperial College London
TERMINATION COMPETITION
Since 2003, the effect of WST to stimulate new research on termination has been enhanced by the Termination Competition
https://termination-portal.org/wiki/Termination_Competition
and its continuously developing Problem Databases containing thousands of programs as challenges for termination analysis in different categories. In 2026, the Termination Competition will run during WST.
CONTACT
- Florian Frohn: florian._surname_(at)informatik.rwth-aachen.de - Étienne Payet: etienne._surname_(at)univ-reunion.fr