WST22: Workshop on Termination Technion, Israel Institute of Technology Haifa, Israel, August 11-12, 2022 |
Conference website | https://sws.cs.ru.nl/WST2022 |
Submission link | https://easychair.org/conferences/?conf=wst22 |
Conference program | https://easychair.org/smart-program/FLoC2022/ |
Submission deadline | May 10, 2022 |
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.
Important Dates
- submission deadline:
May 3, 2022May 10, 2022 - notification:
June 8, 2022June 15, 2022 - final version due:
June 29, 2022July 11 2022 - workshop: August 11-12, 2022
List of Topics
The 18th 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 analysis 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, probabilistic programs, etc.)
- 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 via the submission page:
https://easychair.org/conferences/?conf=wst22
To prepare your submission, please, use LaTeX and the LIPIcs style file
https://submission.dagstuhl.de/styles/download-tag/lipics/v2021.1.2/authors/tgz
Invited Speaker
René Thiemann
CeTA — Efficient Certification of Termination Proofs
We present recent developments in CeTA w.r.t. the efficient certification of termination proofs. Here, efficiency is seen under various aspects. First, we present a case study on minimizing the formalization effort, namely when trying to verify the classical path orders by viewing them as instances of the weighted path order. Second, we argue that the efficient generation of certificates within termination tools requires more powerful certifiers, in particular when considering the usage of SAT- or SMT-solvers. Third, we present recent developments which aim at improving the execution time of CeTA.
Program Committee
- Jose Divasón - U. de La Rioja
- Florian Frohn - AbsInt GmbH
- Jera Hensel - RWTH Aachen
- Dieter Hofbauer - ASW Saarland
- Sebastiaan Joosten - Dartmouth College
- Cynthia Kop (chair) - Radboud U. Nijmegen
- Akihisa Yamada - AIST, Japan
- Hans Zantema - Eindhoven U. of Technology
Contact
All questions about submissions should be emailed to c DOT kop AT cs.ru.nl