Program of WST

Wednesday, July 14th

Wednesday's program is also available with abstracts and side by side with other events.

09:00‑10:00 Invited Talk
Location: IF G.03
09:00 Elvira Albert (Complutense University of Madrid)
From Termination to Cost (in Object-Oriented Languages)
10:30‑12:30 Programming Languages
Location: IF G.03
10:30 Samir Genaim and Damiano Zanardini
The Acyclicity Inference of COSTA
11:00 Christophe Raffalli and Pierre Hyvernat
Improvements on the "Size Change Termination Principle" in a functional language
11:30 Thomas Stroeder, Jürgen Giesl and Peter Schneider-Kamp
Termination Analysis of Logic Programs with Cut Using Dependency Triples
12:00 Paolo Pilozzi and Danny De Schreye
Scaling termination proofs by a characterisation of cycles in CHR
14:00‑15:00 Non-Termination Analysis
Location: IF G.03
14:00 Dean Voets and Danny De Schreye
Non-termination analysis of Logic Programs using Types
14:30 Naoki Nishida, Masahiko Sakai and Tatsuya Hattori
On Disproving Termination of Constrained Term Rewriting Systems
15:30‑17:00 Term Rewriting
Location: IF G.03
15:30 Friedrich Neurauter and Aart Middeldorp
Polynomial Termination over N and R does not imply Polynomial Termination over Q
16:00 Michael Codish, Carsten Fuhs, Jürgen Giesl and Peter Schneider-Kamp
Lazy abstraction for size-change termination
16:30 Dieter Hofbauer and Johannes Waldmann
Match-Bounds for Relative Termination
Thursday, July 15th

Thursday's program is also available with abstracts and side by side with other events.

09:00‑10:00 New Approaches
Location: IF G.03
09:00 Christian Sternagel and René Thiemann
Certification extends Termination Techniques
09:30 Madalina Erascu and Tudor Jebelean
A Purely Logical Approach to Program Termination
10:30‑12:30 Complexity Analysis
Location: IF G.03
10:30 Hans Zantema
Length preserving string rewriting with exponential derivation length
11:00 Martin Avanzini and Naohi Eguchi
A New Path Order for Exponential Time
11:30 Harald Zankl and Martin Korp
The Derivational Complexity of the Bits Function and the Derivation Gap Principle
12:00 Georg Moser and Andreas Schnabl
Dependency Graphs, Relative Rule Removal, the Subterm Criterion and Derivational Complexity
14:00‑15:00 Dependency Pairs
Location: IF G.03
14:00 Bernhard Gramlich and Felix Schernhammer
Outermost Termination via Contextual Dependency Pairs
14:30 Cynthia Kop and Femke van Raamsdonk
Higher Order Dependency Pairs with Argument Filterings
15:30‑17:00 Orders
Location: IF G.03
15:30 Jean-Pierre Jouannaud and Jian-qi Li
A Computability Path Ordering for Polymorphic Terms
16:00 Nachum Dershowitz
An Abstract Path Ordering
16:30 Business Meeting