| 9.20 | - | 9.30: | | Opening |
|
|
| 9.30 | - | 10.30: | | Invited talk: Luke Ong (Oxford Univ, UK) |
| | | |
Verification of infinite structures: a semantic approach
|
| | | | |
|
|
|
| 10.30 | - | 11.00: | | COFFEE BREAK |
| | | | |
| 11.00 | - | 12.30: | | Contributed papers: |
| | | | |
| | | |
Mojmir Kretinsky, Vojtech Rehak and Jan Strejcek
|
| | | |
On Decidability of LTL+Past Model Checking for Process Rewrite Systems |
|
|
| | | |
Emmanuelle Encrenaz and Alain Finkel
|
| | | |
Automatic verification of counter systems with ranking function
|
|
|
| | | |
Tomas Brazdil, Vaclav Brozek and Vojtech Forejt
|
| | | |
Branching-Time Model-Checking of Probabilistic Pushdown Automata
|
| | | | |
|
|
| 12.30 | - | 14.30: | | LUNCH |
|
|
| | | | |
| 14.30 | - | 15.30: | | Invited talk: Vineet Kahlon (NEC Labs, USA) |
| | | |
Towards Tractability of Dataflow Analysis for Concurrent Programs
|
| | | | |
| 15.30 | - | 16.00: | | COFFEE |
| | | | |
| 16.00 | - | 17.00: | | Contributed papers |
| | | | |
| | | |
Franck Pommereau, Raymond Devillers and Hanna Klaudel
|
| | | |
Efficient reachability graph representation of Petri nets with unbounded counters
|
|
|
| | | | |
| | | |
Yohan Boichut, Pierre-Cyrille Heam and Olga Kouchnarenko
|
| | | |
Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives
|
|
|
| 17.00 | - | 17.10: | | Closing |
|
|