| 9.15 | - | 9.30: |
| Opening |
|
|
| 9.30 | - | 10.30: |
| Invited talk:
Byron Cook (Microsoft Research, Cambridge) |
| | | |
Battling Infinity
|
| | | | |
|
|
|
| 10.30 | - | 11.00: | | COFFEE BREAK |
| | | | |
| | | | |
| 11.00 | - | 12.30: | | Contributed papers: |
| | | | |
| | | |
Nguyen Tang
|
| | | |
A Tighter Bound for the Determinization of Visibly Pushdown Automata
|
|
| | | |
Christophe Morvan
|
| | | |
On external presentations of infinite graphs
|
|
|
| | | |
Florent Bouchy, Alain Finkel and Pierluigi San Pietro
|
| | | |
Dense-choice Counter Machines revisited
|
|
|
|
|
| 12.30 | - | 14.30: | | LUNCH |
|
|
| | | | |
| 14.30 | - | 15.30: | | Invited talk:
Martin Leucker
(nstitut für Informatik, Technische
Universität Münche, Germany) |
| | | |
Don't Know for Multi-Valued Systems
|
| | | | |
| | | | |
|
|
|
| 15.30 | - | 16.00: | | COFFEE BREAK |
|
|
| | | | |
| 16.00 | - | 17.30: | | Contributed papers: |
| | | | |
| | | |
Giuseppe Castagna and Luca Padovani
|
| | | |
A preliminary proposal of decidable testing relations for infinitary
asynchronous CCS
|
|
| | | | |
| | | |
Bahareh Badban, Jan-Georg Smaus and Stefan Leue
|
| | | |
Automated Predicate Abstraction for Real-Time Models
|
|
|
| | | |
Etienne Andre and Laurent Fribourg
|
| | | |
An Inverse Method for Policy-Iteration Based Algorithms
|
|
|
|
| 17.30 | - | 17.40: | | CLOSING |
|
|