Boost logo

Boost Interest :

Subject: [Boost-interest] WST 2018 - 2nd Call for Papers (submission: April 15, 2018)
From: Salvador Lucas (slucas_at_[hidden])
Date: 2018-04-03 07:02:38

 Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â  WST 2018 - Call for Papers
 Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â  16th International Workshop on Termination

 Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â  July 18-19, 2017, Oxford, United Kingdom
 Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â


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 2018 Federated Logic Conference
(FLoC 2018)

 Â Â Â Â Â Â Â Â Â

 Â * submission deadline:  April 15, 2018
 Â * notification:         May 15, 2018
 Â * final version due:    May 31, 2018
 Â * workshop:             July 18-19, 2018

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

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, see

 Â Â

In 2018, the Termination Competition will run in parallel with FLoC 2018.
More details will be provided in a dedicated announcement on the

 Â Â Â  Cristina Borralleras - U. de Vic
 Â Â Â  Ugo Dal Lago - U. degli Studi di Bologna
 Â Â Â  Carsten Fuhs - Birkbeck, U. of London
 Â Â Â  Samir Genaim - U. Complutense de Madrid
 Â Â Â  Juergen Giesl - RWTH Aachen
 Â Â Â  Raul Gutiérrez - U. Politecnica de València
 Â Â Â  Keiichirou Kusakari - Gifu University
 Â Â Â  Salvador Lucas (chair) - U. Politecnica de Valencia
 Â Â Â  Fred Mesnard - U. de La Reunion
 Â Â Â  Aart Middeldorp - U. of Innsbruck
 Â Â Â  Albert Rubio - U. Politecnica de Catalunya
 Â Â Â  Rene Thiemann - U. of Innsbruck
 Â Â Â  Caterina Urban - ETH Zürich

 Â Â Â  tba

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

Boost-interest list run by bdawes at, david.abrahams at, gregod at, cpdaniel at, john at