- 9h30:
Opening
- 9h35:
A. Møller,
Verifying Programs That Manipulate Pointers
(invited talk)
- 10h30:
Coffee break
- 11h00:
J. Srba,
Completeness Results for Undecidable Bisimilarity Problems
- 11h30:
G. Delzanno,
A Symbolic Procedure for Control Reachability in the Asynchronous Pi-Calculus
- 12h00:
J.-F. Raskin and L. Van Begin,
Petri Nets with Non-blocking Arcs are Difficult to Analyze
- 12h30:
Lunch
- 14h30:
O. Grinchtein and M. Leucker,
Network Invariants for Real-Time Systems
- 15h00:
M. Kretinsky, V. Rehak, and J. Strejcek,
On Extensions of Process Rewrite Systems: rewrite systems with weak finite-state unit
- 15h30:
J. Leroux,
The Affine Hull of a Binary Automaton is Computable in PTIME
- 16h00:
Coffee break
- 16h30:
A. Bouajjani and T. Touili,
Reachability Analysis of Process Rewrite Systems
- 17h00:
M. Müller-Olm and H. Seidl,
Interprocedural Program Analysis through (Linear) Algebra
- 17h30:
Closing
|
|