<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
</head>
<body>
<p>======================================================================<br>
WST 2022 - Call for Papers<br>
18th International Workshop on Termination<br>
<a class="moz-txt-link-freetext" href="https://sws.cs.ru.nl/WST2022">https://sws.cs.ru.nl/WST2022</a><br>
<br>
August 11-12, 2022, Haifa, Israel<br>
Co-located with IJCAR-11 at FLoC 2022<br>
<br>
======================================================================<br>
<br>
The Workshop on Termination (WST) traditionally brings together,
in an<br>
informal setting, researchers interested in all
aspects of<br>
termination, whether this interest be practical or
theoretical,<br>
primary or derived. The workshop also provides a ground
for<br>
cross-fertilization of ideas from the different communities
interested<br>
in termination (e.g., working on computational mechanisms,
programming<br>
languages, software engineering, constraint solving, etc.).
The<br>
friendly atmosphere enables fruitful exchanges leading to
joint<br>
research and subsequent publications.<br>
</p>
<p><i><b>The submission deadline has been extended by one week.</b></i><br>
<br>
IMPORTANT DATES:<br>
<br>
* submission deadline: <b>May 10, 2022</b><br>
* notification: <b>June 15, 2022</b><br>
* final version due: <b>June 29, 2022</b><br>
* workshop: August 11-12, 2022<br>
<br>
<br>
INVITED SPEAKER: René Thiemann<br>
<br>
TOPICS:<br>
<br>
The 18th International Workshop on Termination welcomes
contributions<br>
on all aspects of termination. In particular, papers
investigating<br>
applications of termination (for example in complexity
analysis,<br>
program analysis and transformation, theorem proving,
program<br>
correctness, modeling computational systems, etc.) are very
welcome.<br>
<br>
Topics of interest include (but are not limited to):<br>
<br>
* abstraction methods in termination analysis<br>
* certification of termination and complexity proofs<br>
* challenging termination problems<br>
* comparison and classification of termination methods<br>
* complexity analysis in any domain<br>
* implementation of termination analysis methods<br>
* non-termination analysis and loop detection<br>
* normalization and infinitary normalization<br>
* operational termination of logic-based systems<br>
* ordinal notation and subrecursive hierarchies<br>
* SAT, SMT, and constraint solving for (non-)termination
analysis<br>
* scalability and modularity of termination methods<br>
* termination analysis in any domain (lambda calculus,
declarative<br>
programming, rewriting, transition systems, probabilistic<br>
programs, etc.)<br>
* well-founded relations and well-quasi-orders<br>
<br>
<br>
SUBMISSION GUIDELINES:<br>
<br>
Submissions are short papers/extended abstracts which should
not<br>
exceed 5 pages. There will be only informal reviewing. In
particular, we<br>
welcome short versions of recently published articles and
papers<br>
submitted elsewhere. The program committee checks relevance
and<br>
provides additional feedback for each submission. The accepted
papers<br>
will be made available electronically before the workshop.<br>
<br>
Papers should be submitted electronically via the submission page:<br>
<br>
<a class="moz-txt-link-freetext" href="https://easychair.org/conferences/?conf=wst22">https://easychair.org/conferences/?conf=wst22</a><br>
<br>
Please, use LaTeX and the LIPIcs style file<br>
<br>
<a class="moz-txt-link-freetext" href="https://submission.dagstuhl.de/styles/download-tag/lipics/v2021.1.2/authors/tgz">https://submission.dagstuhl.de/styles/download-tag/lipics/v2021.1.2/authors/tgz</a><br>
<br>
to prepare your submission.<br>
<br>
<br>
PROGRAM COMMITTEE:<br>
<br>
* Jose Divasón - U. de La Rioja<br>
* Florian Frohn - AbsInt GmbH<br>
* Jera Hensel - RWTH Aachen<br>
* Dieter Hofbauer - ASW Saarland<br>
* Sebastiaan Joosten - Dartmouth College<br>
* Cynthia Kop (chair) - Radboud U. Nijmegen<br>
* Akihisa Yamada - AIST, Japan<br>
* Hans Zantema - Eindhoven U. of Technology<br>
<br>
<br>
</p>
</body>
</html>