WST'03 Program

Tursday, June 12th

• Session 0   17:00-20:00
 
Termination competition "Training camp"/Demos
(open to all participants)

Friday, June 13th

• Opening          8:50

 
• Session 1         9:00-11:00
 
• One Loop at a Time .

Michael Codish, Samir Genaim, Maurice Bruynooghe, John Gallagher and Wim Vanhoof
 
• TerminWeb: Termination Analyzer for Logic Programs .

Samir Genaim and Michael Codish
 
• Proving termination with adornments .

Alexander Serebrenik and Danny De Schreye
 
• Hasta-La-Vista: Termination Analyzer for Logic Programs .

Alexander Serebrenik and Danny De Schreye
 
 
• Cofee break   11:00-11:30
 
 
• Session 2        11:30-13:15
 
• Approximating Dependency Graphs without using Tree Automata Techniques .

Nao Hirokawa and Aart Middeldorp
 
• Tsukuba Termination Tool .

Nao Hirokawa and Aart Middeldorp
 
• Proving termination by the Reduction Constraint Framework .

Crisitna Borralleras and Albert Rubio
 
• Termptation.

Cristina Borralleras and Albert Rubio

 
• Lunch            13:15-15:00

 
• Session 3        15:00-16:30

 
• On the Complexity of Deciding the Derivation Length in Term Rewriting Systems .

Michele Flammini, Paola Inverardi, Domenico Mango and Monica Nesi
 
• Termination Dependencies .

Nachum Dershowitz
 
• Quasi-Ordered Gap Embedding .

Nachum Dershowitz and Iddo Tzameret
 
 
• Cofee break   16:30-16:45

 
• Session 4        16:45-18:45
 
Termination competition and Demos
(open to all participants)
 
• Business meeting     18:45

 

Saturday, June 14th

• Session 1         9:00-11:00
 
• Dependency, Termination and Overlap Analysis of Higher-order Programs: brief preview .

Neil D. Jones
 
• The SCT Analayser: An analysis tool based on size-change termination .

Arne John Glenstrup
 
• AProVE: A System for Proving Termination .

Juergen Giesl, Rene Thiemann, Peter Schneider-Kamp and Stephan Falke
 
• Proving Liveness in Ring Protocols by Termination .

Hans Zantema and Juergen Giesl
 
 
• Cofee break   11:00-11:30
 
 
• Session 2        11:30-13:00
 
• Match-Bounded String Rewriting Systems and Automated Termination Proofs .

Alfons Geser, Dieter Hofbauer and Johannes Waldmann
 
• Applications of termination orderings to mathematics and logic .

Andreas Weiermann
 
• Explicit substitutions and intersection types .

Pierre Lescanne
 
 
• Lunch            13:00-15:00

 
• Session 3        15:00-16:30
 
• Proving Termination of Rewriting with CiME .

Evelyne Contejean, Claude Marche, Benjamin Monate and Xavier Urbain
 
• The TALP Tool for Termination Analysis of Logic Programs .

Enno Ohlebusch, Claus Claves and Claude Marche
 
• On Termination of a Tabulation Procedure for Residuated Logic Programming .

C.V. Damasio and M. Ojeda-Aciego
 
 
• Cofee break   16:30-17:00

 
• Session 4        17:00-18:30
 
• Termination of Computational Restrictions of Rewriting and Termination of Programs .

Salvador Lucas
 
• CARIBOO: A Multi-Strategy Termination Proof Tool Based on Induction .

Olivier Fissore, Helene Kirchner and Isabelle Gnaedig
 
• A Case Study on Termination .

Stephan Frank, Petra Hofstedt and Pierre R. Mai

 

---

Back to WST03's Home Page