皆様，
岐阜大の草刈です．複数受け取られましたらご容赦ください．
7月にイギリスで開催される停止性に関する国際ワークショップ WST(International Workshop on Termination)のCFPをお送りします． 積極的な投稿とご参加をお待ちしております．
========================================================================== WST 2018 - Call for Papers 16th International Workshop on Termination
July 18-19, 2018, Oxford, United Kingdom http://wst2018.webs.upv.es/
==========================================================================
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)
IMPORTANT DATES: * 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
http://termination-portal.org/wiki/Termination_Competition
In 2018, the Termination Competition will run in parallel with FLoC 2018. More details will be provided in a dedicated announcement on the competition.
PROGRAM COMMITTEE: 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
INVITED SPEAKERS: 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:
https://easychair.org/conferences/?conf=wst2018
Please, use LaTeX and the LIPIcs style file
http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz
to prepare your submission.
-
KUSAKARI Keiichirou