|
12:00 - 12:50 Registration
12:50 - 13:00 Opening
13:00 - 13:50 Session 1 (Invited Talk)
|
A Survey of Some Recent Trends in Rewrite-Based and
Paramodulation-Based Deduction,
Robert Nieuwenhuis
|
13:50 - 14:15 Coffee Break
14:15 - 15:30 Session 2
|
|
Transforming Context-Sensitive Rewrite Systems,
Jürgen Giesl and Aart Middeldorp
|
|
|
Symbolic Analysis of Timed Multiset Rewriting and
Its Applications to Protocol Analysis,
Masami Hagiya, Mitsuharu Yamamoto, and Jean-Marie Cottin
|
|
|
Theorem Prover for Modal Logics with Tableau Method,
Toshimasa Matsumoto and Hiroakira Ono
|
15:30 - 15:50 Coffee Break
15:50 - 16:40 Session 3 (Invited Talk)
|
|
Rewriting Can Verify Distributed Real-Time Systems
- How to Specify and Verify in CafeOBJ -,
Kokichi Futatsugi and Kazuhiro Ogata
|
16:40 - 17:00 Coffee Break
17:00 - 17:50 Session 4
|
|
Completeness and Strictness Analysis
for the Evaluation Strategy,
Masaki Nakamura and Kokichi Futatsugi
|
|
|
An Upper Bound of the Values of
Primitive Recursive Functionals,
Takeuti Izumi
|
|
|
|
9:00 - 9:50 Session 5 (Invited Talk)
|
|
A Lambda Model Characterizing Computational Behaviours of Terms,
Mariangiola Dezani-Ciancaglini and Silvia Ghilezan
|
9:50 - 10:05 Coffee Break
10:05 - 10:55 Session 6
|
|
On the Standardization Theorem for λβη-Calculus,
Ryo Kashima
|
|
|
A Formalised First-Order Confluence Proof for the λ-Calculus
using One-Sorted Variable Names,
René Vestergaard and James Brotherston
|
10:55 - 11:10 Coffee Break
11:10 - 12:00 Session 7 (Invited Talk)
|
|
Word Problems and Complete Rewriting Systems,
Yuji Kobayashi
|
12:00 - 13:30 Lunch
13:30 - 14:20 Session 8 (Invited Talk)
|
|
Higher-Order Recursive Path Orderings à la carte,
Jean-Pierre Jouannaud and Albert Rubio
|
14:20 - 14:35 Coffee Break
14:35 - 15:50 Session 9
|
|
On New Dependency Pair Method for Proving Termination of
Higher-Order Rewrite Systems,
Masahiko Sakai and Keiichirou Kusakari
|
|
|
Generation of Inverse Term Rewriting Systems
for Pure Treeless Functions,
Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe
|
|
|
Complete Axiomatization for an Algebraic Construction of Graphs,
Mizuhito Ogawa
|
15:50 - 16:05 Coffee Break
16:05 - 16:55 Session 10 (Invited Talk)
|
|
An E-Critical Pair Completion Procedure for Nonterminating TRS's
and its Application,
Michio Oyamaguchi
|
16:55 - 17:10 Coffee Break
17:10 - 18:00 Session 11 (Invited Talk)
|
|
Well-Ordering on Initial Algebras,
Ryu Hasegawa
|
18:00 - 20:00 Reception
|
|
|
9:00 - 9:50 Session 12 (Invited Talk)
|
|
Tree Automata and Term Rewriting,
Sophie Tison
|
9:50 - 10:05 Coffee Break
10:05 - 10:55 Session 13
|
|
Timed Properties for Process Languages with Time,
Irek Ulidowski and Shoji Yuen
|
|
|
An Efficient Construction of Counter-Models for Modal Logic S4,
Motohiko Mouri
|
10:55 - 11:10 Coffee Break
11:10 - 12:00 Session 14 (Invited Talk)
|
|
Limit Computable Mathematics and Interactive Computation,
Susumu Hayashi
|
12:00 - 12:10 Closing
|
