[Haskell-cafe] WST 2018 - Call for Participation (July 18-19, 2018)

[Salvador Lucas]

==========================================================================

                        WST 2018 - Call for Participation
                    16th International Workshop on Termination
                               part of FLoC 2018

                     July 18-19, 2018, Oxford, United Kingdom
                           http://wst2018.webs.upv.es/

==========================================================================

REGISTRATION (June 6th is the last day for early registration!)

    http://www.floc2018.org/register/

INVITED SPEAKERS:

     James Worrell - University of Oxford
        "Termination Checking and Invariant Synthesis for Affine Programs"

     Akihisa Yamada - NII Japan
        "Towards a Unified Method for Termination"

PROGRAMME (see also the list of accepted papers attached below):

    https://easychair.org/smart-program/FLoC2018/WST-program.html

TERMINATION AND COMPLEXITY COMPETITION:

In 2018, the Termination and Complexity Competition (TERCOMP) will run
in parallel with FLoC 2018 as part of the FLoC Olympic Games.
The results of the competition will be presented and discussed during
a special session at WST 2018.

ACCEPTED PAPERS:

Eric Hehner.
Objective and Subjective Specifications.

Guillaume Genestier and Frédéric Blanqui.
Termination of Lambda-Pi modulo rewriting using the size-change principle

Jera Hensel, Florian Frohn and Jürgen Giesl.
Complexity Analysis for Bitvector Programs

Alfons Geser, Dieter Hofbauer and Johannes Waldmann.
Comparing on Strings: Semantic Kachinuki Order

Nachum Dershowitz and Jean-Pierre Jouannaud.
GPO: A Path Ordering for Graphs

Jose Divasón, Sebastiaan Joosten, René Thiemann and Akihisa Yamada.
A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving

Jonas Schöpf and Christian Sternagel.
TTT2 with Termination Templates for Teaching

Cristina David, Daniel Kroening and Peter Schrammel.
Procedure-Modular Termination Analysis

Salvador Lucas.
Well-founded models in proofs of termination

Aalok Thakkar, Balaji Krishnamurthy and Piyush Gupta.
Verification of Rewriting-based Query Optimizers

Jesús J. Doménech, Samir Genaim and John P. Gallagher.
Control-Flow Refinement via Partial Evaluation

Alicia Merayo Corcoba and Samir Genaim.
Inference of Linear Upper-Bounds on the Expected Cost by Solving Cost 
Relations

Dieter Hofbauer.
Embracing Infinity - Termination of String Rewriting by Almost Linear 
Weight Functions

Carsten Fuhs and Cynthia Kop.
Improving Static Dependency Pairs for Higher-Order Rewriting