CONCUR 2005 - Preliminary Program

23-26 August 2005

TUESDAY 23th August

9:00-10:00 Invited Talk

Dawson Engler: Static Analysis Versus Model Checking for Bug Finding

10:00-10:30 COFFEE BREAK

10:30-12:30 Morning Session

• Type-Directed Concurrency
  Deepak Garg, Frank Pfenning
• Multiport Interaction Nets and Concurrency
  Damiano Mazza
• Model Checking for Pi-calculus Using Proof Search
  Alwen Tiu
• A Game Semantics of the Asynchronous Pi-Calculus
  Jim Laird

12:30-2:00 LUNCH

2:00-4:00 Afternoon Session

• Efficient On-the-fly Algorithms for the Analysis of Timed Games
  Franck Cassez, Alexandre David, Emmanuel Fleury, Kim G. Larsen and Didier Lime
• Modal Logics for Timed Control
  Patricia Bouyer, Franck Cassez, François Laroussinie
• Timed Shuffle Expressions
  Catalin Dima
• A New Modality for Almost Everywhere Properties in Timed Automata
  Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie

4:00-4:30 COFFEE BREAK

4:30-6:30 Afternoon Session

• The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation
  Pedro R. D'Argenio and Biniam Gebremichael
• A Behavioural Pseudometric for Metric Labelled Transition Systems
  Franck van Breugel
• On Probabilistic Program Equivalence and Refinement
  Andrzej S. Murawski and Joel Ouaknine
• Probabilistic Anonymity
  Mohit Bhargava and Catuscia Palamidessi

WEDNESDAY 24th August

9:00-10:00 Invited Talk

Rajeev Alur: The Benefits of Exposing Calls and Returns

10:00-10:30 COFFEE BREAK

10:30-12:30 Morning Session

• Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus
  Andrew D. Gordon and Alan Jeffrey
• Timed SPI-CALCULUS with Types for Secrecy and Authenticity
  Christian Haack and Alan Jeffrey
• Selecting Theories and Recursive Protocols
  Tomasz Truderung
• Constraint Solving for Contract-Signing Protocols
  Detlef Kaehler and Ralf Kuesters

12:30-2:00 LUNCH

2:00-4:00 Afternoon Session

• A Ground-Complete Axiomatization of Finite State Processes in Process Algebra
  J.C.M. Baeten, M. Bravetti
• Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP
  Sibylle Froeschle and Slawomir Lasota
• Bisimulation Up-To for the Linear Time-Branching Time Spectrum
  David de Frutos Escrig and Carlos Gregorio Rodriguez.
• Deriving Weak Bisimulation Congruences from Reduction Systems
  Roberto Bruni, Fabio Gadducci, Ugo Montanari, and Pawel Sobocinski

4:00-4:30 COFFEE BREAK

4:30-6:00 Afternoon Session

• SOS for Higher Order Processes
  MohammadReza Mousavi, Murdoch J. Gabbay, Michel A. Reniers
• The Individual and Collective Token Interpretations of Petri Nets
  Rob van Glabbeek
• Merged Processes - a New Condensed Representation of Petri Net Behaviour
  Victor Khomenko, Alex Kondratyev, Maciej Koutny and Walter Vogler

THURSDAY 25th August

9:00-10:00 Invited Talk

Luca Cardelli: A Compositional Approach to the Stochastic Dynamics of Gene Networks

10:00-10:30 COFFEE BREAK

Morning Session 10:30-12:30

• Concurrent Clustered Programming
  Vijay Saraswat and Radha Jagadeesan
• A Theory of System Behaviour in the Presence of Node and Link Failures
  Adrian Francalanza and Matthew Hennessy
• Comparing Two Approaches to Compensable Flow Composition
  Roberto Bruni, Michael Butler, Carla Ferreira, Tony Hoare, Hernán Melgratti and Ugo Montanari
• Transactions in RCCS
  Vincent Danos and Jean Krivine

12:30-2:00 LUNCH

EXCURSION and BANQUET

FRIDAY 26th August

9:00-10:00 Invited Talk

Christos Papadimitriou: Games Other People Play

10:00-10:30 COFFEE BREAK

10:30-12:30 Morning Session

• Two-Player Nonzero-Sum $\omega$-Regular Games
  Krishnendu Chatterjee
• Games Where You Can Play Optimally Without Any Memory
  Hugo Gimbert and Wieslaw Zielonka
• On Implementation of Global Concurrent Systems with Local Asynchronous Controllers
  Blaise Genest
• Defining Fairness
  Hagen Voelzer, Daniele Varacca, Ekkart Kindler

12:30-2:00 LUNCH

2:00-4:00 Afternoon Session

• Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
  Ahmed Bouajjani, Markus Mueller-Olm, and Tayssir Touili
• Termination Analysis of Integer Linear Loops
  Aaron R. Bradley, Zohar Manna, Henny B. Sipma
• A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs
  Eric Goubault and Emmanuel Haucourt
• Verification of Qualitative Z Constraints
  Stephane Demri and Regis Gascon

4:00-4:30 COFFEE BREAK

4:30-6:00 Afternoon Session

• Uniform Satisfiability Problem for Local Temporal Logics Over Mazurkiewicz Traces
  Dietrich Kuske and Paul Gastin
• Taming Interface Specifications
  Tiziana Margaria, A. Prasad Sistla, Bernhard Steffen, and Lenore D. Zuck
• Synthesis of Distributed Systems from Knowledge-Based Specifications
  Ron van der Meyden and Thomas Wilke

END of CONFERENCE