RDP                     
Home page
Organization
Sponsors

MEETINGS        
RTA
TLCA
FTP
WG1.6
RULE
UNIF
WFLP
WRS
WST

VENUE               
Valencia
Registration
Accomodation
Travelling
Program
Conference Venue
Internet
WST'03
6th International Workshop on Termination
Valencia, Spain, June 13-14, 2003


PRELIMINARY PROGRAM

Sunday Monday Tuesday Wednesday Thursday Friday Saturday
8 9 10 11 12 13 14
09:00 - 11:00 Session 1 Session 6
11:00 - 11:30 Coffee break Coffee break
11:30 - 13:00 Session 2 Session 7
13:00 - 15:00 Lunch Lunch
15:00 - 16:30 Session 3 Session 8
16:30 - 17:00 Coffee break Coffee break
17:00 - 18:30 Session 0 Session 4 Session 9
18:30 - 20:00 Session 0 Session 5

Please, check the exact starting time for that session.

    Workshop Room:
    First Floor - ´Aula 1.1´ & ´Aula 1.2´

    Equipped with:
    1. a blackboard (or similar),
    2. an overhead projector,
    3. a video projector (for laptops),
    4. a PC running under Windows with
      • Adobe Acrobat Reader 5.0, and
      • MS PowerPoint 2000 installed.

 

Thursday, June 12


17:00 - 20:00 Session 0 - Termination competition "Training camp" and Demos
Workshop room: First Floor - ´Aula 1.3´

 

Friday, June 13


9:00 - 11:00 Session 1
Workshop room: First Floor - ´Aula 1.1´ & ´Aula 1.2´
9:00 - 9:30 One Loop at a Time
M. Codish, S. Genaim, M. Bruynooghe, J. Gallagher, and W. Vanhoof
9:30 - 10:00 TerminWeb: Termination Analyzer for Logic Programs
S. Genaim and M. Codish
10:00 - 10:30 Proving termination with adornments
A. Serebrenik and D. De Schreye
10:30 - 11:00 Hasta-La-Vista: Termination Analyser for Logic Programs
A. Serebrenik and D. De Schreye
11:00 - 11:30Coffee break
11:30 - 13:15Session 2
Workshop room: First Floor - ´Aula 1.1´ & ´Aula 1.2´
11:30 - 12:00 Approximating Dependency Graphs without using Tree Automata Techniques
N. Hirokawa and A. Middeldorp
12:00 - 12:30 Tsukuba Termination Tool
N. Hirokawa and A. Middeldorp
12:30 - 13:00 Proving termination by the Reduction Constraint Framework
C. Borralleras and A. Rubio
13:00 - 13:15 Termptation
C. Borralleras and A. Rubio
13:15 - 15:00Lunch
15:00 - 16:30 Session 3
Workshop room: First Floor - ´Aula 1.1´ & ´Aula 1.2´
15:00 - 15:30 Explicit substitutions and intersection types
P. Lescanne
15:30 - 16:00 Termination Dependencies
N. Dershowitz
16:00 - 16:30 Quasi-Ordered Gap Embedding
N. Dershowitz and I. Tzameret
16:30 - 16:45Coffee break
16:45 - 18:45 Session 4 - Termination Competition and Demos
Workshop room: First Floor - ´Aula 1.1´ & ´Aula 1.2´
18:45 - 19:00 Session 5 - Business meeting

Saturday, June 14


9:00 - 11:00 Session 6
Workshop room: First Floor - ´Aula 1.1´ & ´Aula 1.2´
9:00 - 9:30 Dependency, Termination and Overlap Analysis of Higher-order Programs: brief preview
N. Jones
9:30 - 10:00 The SCT Analayser: An analysis tool based on size-change termination
A.J. Glenstrup
10:00 - 10:30 AProVE: A System for Proving Termination
J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke
10:30 - 11:00 Proving Liveness in Ring Protocols by Termination
H. Zantema and J. Giesl
11:00 - 11:30Coffee break
11:30 - 13:00Session 7
Workshop room: First Floor - ´Aula 1.1´ & ´Aula 1.2´
11:30 - 12:00 Match-Bounded String Rewriting Systems and Automated Termination Proofs
A. Geser, D. Hofbauer, and J. Waldmann
12:00 - 12:30 Mathematical and logical aspects of termination orderings
A. Weiermann
12:30 - 13:00 On the Complexity of Deciding the Derivation Length in Term Rewriting Systems
M. Flammini, P. Inverardi, D. Mango, and M. Nesi
13:00 - 15:00Lunch
15:00 - 16:30 Session 8
Workshop room: First Floor - ´Aula 1.1´ & ´Aula 1.2´
15:00 - 15:30 Proving Termination of Rewriting with CiME
E. Contejean, C. Marché, B. Monate, and X. Urbain
15:30 - 16:00 The TALP Tool for Termination Analysis of Logic Programs
E. Ohlebusch, C. Claves, and C. Marché
16:00 - 16:30 On Termination of a Tabulation Procedure for Residuated Logic Programming
M. Ojeda-Aciego and C.V. Damásio
16:30 - 17:00Coffee break
17:00 - 18:30 Session 9
Workshop room: First Floor - ´Aula 1.1´ & ´Aula 1.2´
17:00 - 17:30 Termination of Computational Restrictions of Rewriting and Termination of Programs
S. Lucas
17:30 - 18:00 CARIBOO : A Multi-Strategy Termination Proof Tool Based on Induction
O. Fissore, I. Gnaedig, and H. Kirchner
18:00 - 18:30 A Case Study on Termination
S. Frank, P. Hofstedt, and P. Mai

End of WST'03                                                                                                                                                                                                                


Last update May 2003 #
sescobar@dsic.upv.es