WST 2016
15th International Workshop on Termination
September 5-7, 2016, Obergurgl, Austria
Program Committee
| Ugo Dal Lago | Bologna University | |
| Jörg Endrullis | VU University Amsterdam | |
| Yukiyoshi Kameyama | University of Tsukuba | |
| Salvador Lucas | Universidad Politécnica de Valencia | |
| Aart Middeldorp | University of Innsbruck | (co-chair) |
| Thomas Ströder | RWTH Aachen | |
| René Thiemann | University of Innsbruck | (co-chair) |
| Andreas Weiermann | Ghent University |
Program
There will be 13 regular presentations at WST 2016:
- Christophe Alias, Carsten Fuhs and Laure Gonnord
(slides) Estimation of Parallel Complexity with Rewriting Techniques - Cristina Borralleras, Marc Brockschmidt, Daniel Larraz, Albert Oliveras, Enric Rodríguez Carbonell and Albert Rubio
(slides) Proving termination through conditional termination - Marc Brockschmidt, Sebastiaan Joosten, René Thiemann and Akihisa Yamada
(slides) Certifying Safety and Termination Proofs for Integer Transition Systems - Florian Frohn, Marc Brockschmidt and Jürgen Giesl
(slides) Automated Inference of Upper Complexity Bounds for Java Programs - Florian Frohn, Matthias Naaf, Jera Hensel, Marc Brockschmidt and Jürgen Giesl
(slides) Lower Runtime Bounds for Integer Programs - Carsten Fuhs
(slides) SMT-Based Techniques in Automated Termination Analysis - Alfons Geser, Johannes Waldmann and Mario Wenzel
(slides) Symbolic Enumeration of One-Rule String Rewriting Systems - Jera Hensel, Jürgen Giesl, Florian Frohn and Thomas Ströder
(slides) Termination Analysis of Programs with Bitvector Arithmetic by Symbolic Execution - Cynthia Kop
(slides) Non-deterministic Characterisations - Christian Sternagel
(slides) The Generalized Subterm Criterion in TTT2 - Thomas Sternagel and Christian Sternagel
(slides) A Characterization of Quasi-Decreasingness - Hans Zantema, Dennis Nolte and Barbara König
(slides) Termination of Term Graph Rewriting - Hans Zantema and Alexander Fedotov
(slides) Nontermination of string and cycle rewriting by automata