19th International Workshop on Termination

From Termination-Portal.org
Jump to navigationJump to search

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

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 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.

Important Dates

  • submission (abstract): May 7
  • submission (paper): May 14
  • notification: June 11
  • workshop: August 24-25

Program Committee

  • Akihisa Yamada, AIST (chair)
  • TBA...