| WST 2006 | Eighth International Workshop on Termination Seattle, August 15 - 16, 2006 |
Program
All sessions will take place in Suite 2628 unless otherwise indicated.
Tuesday, August 15th
Tuesday's program is also available with abstracts or side by side with other meetings.
08:50‑09:00 Welcome to WST 2006
09:00‑10:00 Invited Talk
| 09:00 | Byron Cook
(Microsoft Research Cambridge) Program termination analyses for free! [ppt] |
10:00‑10:30 Break
10:30‑11:30 Session 1: Logic Programming
| 10:30 | Peter Schneider-Kamp
, Juergen Giesl
, Alexander Serebrenik
and Rene Thiemann
Termination Analysis for Logic Programs by Term Rewriting Revisited |
| 11:00 | Manh Thang Nguyen, Maurice Bruynooghe, Danny De Schreye and Michael Leuschel
Program Specialisation as a Pre-processing Step for Termination Analysis |
11:30‑12:30 Session 2: Narrowing; Non-Termination
| 11:30 | Naoki Nishida
and Koichi Miura Dependency Graph Method for Proving Termination of Narrowing |
| 12:00 | Yi Wang and Masahiko Sakai
On Non-looping Term Rewriting |
12:30‑14:00 Lunch break
14:00‑15:00 Session 3: Higher-Order Rewriting
| 14:00 | Frederic Blanqui
Higher-order dependency pairs |
| 14:30 | Wojciech Moczydlowski
Normalization of intuitionistic set theories |
15:00‑15:30 Termination Competition
| 15:00 | Claude Marche and Hans Zantema Report on termination competition 2006 |
15:30‑16:00 Break
16:00‑17:00 Session 4: String Rewriting
| 16:00 | Joerg Endrullis
, Dieter Hofbauer
and Johannes Waldmann
Decomposing Terminating Rewrite Relations |
| 16:30 | Hans Zantema
Termination of Extended String Rewriting |
17:00‑18:00 Business Meeting
Wednesday, August 16th
Wednesday's program is also available with abstracts or side by side with other meetings.
09:30‑10:30 Invited Talk
| 09:30 | Yuri Gurevich
(Microsoft Research Redmond) Program termination and well partial orderings [ppt] |
10:30‑11:00 Break
11:00‑12:30 Session 5: SAT Encoding
| 11:00 | Harald Zankl, Nao Hirokawa and Aart Middeldorp
Constraints for Argument Filterings |
| 11:30 | Harald Zankl and Aart Middeldorp
KBO as a Satisfaction Problem |
| 12:00 | Michael Codish, Peter Schneider-Kamp
, Vitaly Lagoon, Rene Thiemann
and Juergen Giesl
Automating Dependency Pairs Using SAT Solvers |
12:30‑14:00 Lunch break
14:00‑15:30 Session 6: Applications
15:30‑16:00 Break
16:00‑16:30 Session 7: Ordinals and Growth
| 16:00 | Andreas Weiermann Phase transition phenomena in the context of termination problems |
16:30‑18:30 System Demonstrations
