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 16th International Workshop on Termination in Oxford 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), and Obergurgl (2016).

You may also follow the news about the next (17th) edition of the workshop: WST 2020!

WST 2018 was part of the Federated Logic Conference 2018 (FLoC 2018) that brings together several international conferences related to mathematical logic and computer science. The workshop is affiliated to IJCAR, and also to CAV, FM, FSCD, ICLP, LICS, and SAT.

Workshop Topics

The 16th 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):

  • abstraction methods in termination analysis
  • certification of termination and complexity proofs
  • challenging termination problems
  • comparison and classification of termination methods
  • complexity analysis in any domain
  • 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
  • termination analysis in any domain (lambda calculus, declarative programming, rewriting, transition systems, etc.)
  • 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 2018, the Termination Competition was part of the FLoC Olympic Games (July 13-14, 2018).

Important dates

    Submission deadline: April 15, 2018 April 30, 2018
    Notification:  May 15, 2018 May 25, 2018
    Final version due:  May 31, 2018 June 11, 2018
    Workshop: July 18-19, 2018


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.

Invited Speakers

  • James Worrell - University of Oxford, UK

    Termination Checking and Invariant Synthesis for Affine Programs (slides)

  • Akihisa Yamada - National Institute of Informatics, Japan

    Towards a Unified Method for Termination (slides)

Accepted Papers

  • Eric Hehner. Objective and Subjective Specifications
  • Guillaume Genestier and Frédéric Blanqui. Termination of Lambda-Pi modulo rewriting using the size-change principle (slides)
  • Jera Hensel, Florian Frohn and Jürgen Giesl. Complexity Analysis for Bitvector Programs (slides)
  • Alfons Geser, Dieter Hofbauer and Johannes Waldmann. Comparing on Strings: Semantic Kachinuki Order
  • Nachum Dershowitz and Jean-Pierre Jouannaud. GPO: A Path Ordering for Graphs (slides)
  • Jose Divasón, Sebastiaan Joosten, René Thiemann and Akihisa Yamada. A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving (slides)
  • Jonas Schöpf and Christian Sternagel. TTT2 with Termination Templates for Teaching
  • (slides)
  • Cristina David, Daniel Kroening and Peter Schrammel. Procedure-Modular Termination Analysis (slides)
  • Salvador Lucas. Well-founded models in proofs of termination (slides)
  • Aalok Thakkar, Balaji Krishnamurthy and Piyush Gupta. Verification of Rewriting-based Query Optimizers
  • Jesús J. Doménech, Samir Genaim and John P. Gallagher. Control-Flow Refinement via Partial Evaluation (slides)
  • Alicia Merayo Corcoba and Samir Genaim. Inference of Linear Upper-Bounds on the Expected Cost by Solving Cost Relations (slides)
  • Dieter Hofbauer. Embracing Infinity - Termination of String Rewriting by Almost Linear Weight Functions (slides)
  • Carsten Fuhs and Cynthia Kop. Improving Static Dependency Pairs for Higher-Order Rewriting (slides)

Tool papers

  • Georg Moser and Michael Schaper. TcT: Tyrolean Complexity Tool
  • M. Brockschmidt, S. Dollase, F. Emrich, F. Frohn, C. Fuhs, J. Giesl, M. Hark, J. Hensel, D. Korzeniewski, M. Naaf, T. Ströder. AProVE at the Termination Competition 2018 (slides)
  • Florian Messner and Christian Sternagel. TermComp 2018 Participant: TTT2 (slides)
  • Dieter Hofbauer. MultumNonMulta at TermComp 2018 (slides)
  • Matthias Heizmann, Daniel Dietsch, and Alexander Nutz. Ultimate Büchi Automizer
  • Raúl Gutiérrez and Salvador Lucas. MU-TERM at the 2018 Termination Competition (slides)
  • Jesús J. Doménech and Samir Genaim. iRankFinder


Please, find the WST 2018 proceedings here.


Please, find the WST 2018 program, as part of the Live FLoC 2018 programme here.

Program Committee