Programme

Monday 30 August

Workshops:

09:00Session
10:30Break
11:00Session
13:00Lunch
14:30Session
16:00Break
16:30Session
18:00End

Tuesday 31 August

08:50Welcome
09:00 Invited talk A Grand Challenge: Towards Full Reactive Modeling of a Multi-Cellular Animal
  David Harel
10:00 Reversible Communicating Systems
  Vincent Danos, Jean Krivine
10:30Break
11:00 Message-Passing Automata are expressively equivalent to EMSO Logic
  Benedikt Bollig and Martin Leucker
11:30 The pros and cons of netcharts
  Nicolas BAUDRU & Remi MORIN
12:00 On Flatness for 2-dimensional Vector Addition Systems with States
  Jérôme Leroux and Grégoire Sutre
12:30 Verifying Finite-State Graph Grammars: an Unfolding-Based Approach
  Paolo Baldan, Andrea Corradini, Barbara Koenig
13:00Lunch
14:30 Symbolic Bisimulation in the Spi Calculus
  Johannes Borgström, Sébastien Briais, Uwe Nestmann
15:00 A symbolic decision procedure for cryptographic protocols with time stamps
  L. Bozga, C. Ene and Y. Lakhnech
15:30 Basic Theory of Reduction Congruence for Two Timed Asynchronous Pi-Calculi
  Martin Berger
16:00Break
16:30 Probabilistic Event Structures and Domains
  Daniele Varacca, Hagen Voelzer, Glynn Winskel
17:00 Open maps, alternating simulations and control synthesis
  Paulo Tabuada
17:30 Asynchronous Games 2: The true concurrency of innocence
  Paul-André Melliès
18:00Reception

Wednesday 1 September

09:00 Resource Control for Synchronous Cooperative Threads
  Roberto M. Amadio and Silvano Dal Zilio
09:30 Compiling Pattern Matching in Join-Patterns
  Qin Ma and Luc Maranget
10:00 muABC: A Minimal Aspect Calculus
  Glenn Bruns, Radha Jagadeesan, Alan Jeffrey, James Riely
10:30Break
11:00 Deciding Probabilistic Bisimilarity over Infinite-State Probabilistic Systems
  T. Brazdil, A. Kucera, O. Strazovsky
11:30 Extended Process Rewrite Systems: Expressiveness and Reachability
  Mojmir Kretinsky, Vojtech Rehak, Jan Strejcek
12:00 Parameterised boolean equation systems (extended abstract)
  Jan Friso Groote and Tim A.C. Willemse
12:30 Characterizing EF and EX tree logics
  Mikolaj Bojanczyk Igor Walukiewicz
13:00Lunch
14:30 Model Checking Restricted Sets of Timed Paths
  N. Markey and J.-F. Raskin
15:00 Model Checking Timed Automata with One or Two Clocks
  F. Laroussinie, N. Markey, Ph. Schnoebelen
15:30 Timed vs Time-Triggered Automata
  Pavel Krcal, Leonid Mokrushin, P.S. Thiagarajan and Wang Yi
16:00Break
16:30 Tutorial Regular Model Checking
  Bengt Jonsson
18:00End

Thursday 2 September

09:00 Comparing Infinite-State Systems with Their Finite-State Specifications
  A. Kucera, Ph. Schnoebelen
09:30 A Higher Order Modal Fixed Point Logic
  Mahesh Viswanathan, Ramesh Viswanathan
10:00 Modular Construction of Modal Logics
  Corina Cirstea and Dirk Pattinson
10:30Break
11:00 Tutorial Resources, Concurrency and Local Reasoning
  Steve Brookes and Peter O'Hearn
13:00Lunch
14:00Excursion and dinner (till late)

Friday 3 September

09:00 Invited talk Zing: Exploiting Program Structure for Model Checking Concurrent Software
  Sriram K. Rajamani
10:00 Verification by Network Decomposition
  Edmund Clarke, Muralidhar Talupur, Tayssir Touili, Helmut Veith
10:30Break
11:00 Elimination of Quantifiers and Undecidability in Spatial Logics for Concurrency
  Luis Caires and Etienne Lozes
11:30 An Extensional Spatial Logic for Mobile Processes
  Daniel Hirschkoff
12:00 Type Based Discretionary Access Control
  Michele Bugliesi, Dario Colazzo, Silvia Crafa
12:30 Session Types for Functional Multithreading
  Vasco Vasconcelos and Antonio Ravara and Simon Gay
13:00Lunch
14:30Start of FGUC
Invited talk TBA
  Robin Milner
15:30 TBA
  Andrew Gordon
16:00Break
16:30 Analysing mobile networks via probabilistic model checking
  Marta Kwiatkowska
17:00 Panel Session on Grand Challenge
18:00End

Saturday 4 September

Workshops:

09:00Session
10:30Break
11:00Session
13:00Lunch
14:30Session
16:00Break
16:30Session
18:00End