Printable PDF version
Time Speaker Talk
9:00 Général Xavier Michel, Ecole Polytechnique's President. Opening
9:10 Jean-Marc Steyaert, Catuscia Palamidessi, Jean-Jacques Levy. Opening
9:30 Robin Milner Bigraphs and Confluence.
10:30 Coffee break
11:00 Mogens Nielsen Computational Trust - Ideas towards a Science for Ubiquitous Computing .
11:30 Wan Fokkink Cones and foci: A mechanical framework for protocol verification.
12:00 Cedric Fournet Computational Secrecy by Typing for the Pi Calculus.
12:30 Lunch
14:00 Jan Bergstra Thread algebra for strategic interleaving .
14:30 Andrew Gordon A chart semantics for the pi-calculus.
15:00 Joachim Parrow Expressiveness of Process Algebras ( Discussion ).
16:00 Coffee break
16:30 Roberto Amadio A synchronous pi-calculus .
17:00 Jos Baeten Using hybrid process algebra in model-based engineering of embedded systems .
17:30 Hubert Garavel Practical applications of process calculi in industrial projects .
18:00 Reception
Time Speaker Talk
9:00 Tony Hoare Verification of Fine-grain Concurrency: Invariant Assertions, Rely/Guarantee Conditions, and perhaps Separation Logic and Petri nets .
10:00 Luis Caires Properties of Interaction in Space .
10:30 Coffee break
11:00 Pierre-Louis Curien An approach to innocent strategies as graphs.
11:30 Jesper Bengston Formalising the pi-calculus using nominal logic.
12:00 Jean-Jacques Levy History based information flow in the lambda calculus .
12:30 Lunch
14:00 Ugo Montanari A Coalgebraic Theory of Reactive Systems .
15:00 Pawel Sobocinski Towards a general theory of labels from reductions .
15:30 Mike Mislove Probabilistic Semantics.
16:00 Coffee break
16:30 Roberto Segala Probability and Concurrency: where are the Problems?.
17:00 Marta Kwiatowska Analysing mobile ad hoc network protocols via probabilistic model checking.
17:30 Mario Bravetti Extentions of standard weak bisimulation machinery: finite-state general processes, refinable actions, maximal-progress and time.
18:00 End of Session
Time Speaker Talk
9:00 Luca Cardelli Artificial Biochemistry .
10:00 Nadia Busi Expressiveness of bio-inspired process calculi .
10:30 Coffee break
11:00 Kazunori Ueda Hierarchical graph rewriting as a unifying model of concurrency .
11:30 Vijay Saraswat A Theory of Memory Models .
12:00 Marco Carbone A Theoretical Basis of Communication-Centred Concurrent Programming .
12:30 Lunch
14:00 Glynn Winskel Causality Types .
14:30 Giuseppe Castagna Milner's encoding revisited: new trends in (sub-)typing the pi-calculus.
15:00 Frank de Boer Object-oriented concurrency .
15:30 Peter Sewell From HOL, ML and Pi-calculus to typed distributed programming.
16:00 Coffee break
16:30 Laurent Fribourg The critical-path problem in asynchronous circuits: A concurrency view .
17:00 Uwe Nestmann Applications of Concurrency Theory to Distributed Algorithms .
17:30 End of Session