CONCUR 2005 - Concurrency Theory

1. Front Matter

   PDF

2. Invited Lectures

   1. Static Analysis Versus Model Checking for Bug Finding

      • Dawson Engler

      Pages 1-1

   2. The Benefits of Exposing Calls and Returns

      • Rajeev Alur

      Pages 2-3

   3. A Compositional Approach to the Stochastic Dynamics of Gene Networks

      • Luca Cardelli

      Pages 4-4

3. Contributed Papers

   1. Games Other People Play

      • Christos H. Papadimitriou

      Pages 5-5

   2. Type-Directed Concurrency

      • Deepak Garg, Frank Pfenning

      Pages 6-20

   3. Multiport Interaction Nets and Concurrency

      • Damiano Mazza

      Pages 21-35

   4. Model Checking for π-Calculus Using Proof Search

      • Alwen Tiu

      Pages 36-50

   5. A Game Semantics of the Asynchronous π-Calculus

      • Jim Laird

      Pages 51-65

   6. Efficient On-the-Fly Algorithms for the Analysis of Timed Games

      • Franck Cassez, Alexandre David, Emmanuel Fleury, Kim G. Larsen, Didier Lime

      Pages 66-80

   7. Modal Logics for Timed Control

      • Patricia Bouyer, Franck Cassez, François Laroussinie

      Pages 81-94

   8. Timed Shuffle Expressions

      • Cătălin Dima

      Pages 95-109

   9. A New Modality for Almost Everywhere Properties in Timed Automata

      • Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie

      Pages 110-124

   10. The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation

       • Pedro R. D’Argenio, Biniam Gebremichael

       Pages 125-140

   11. A Behavioural Pseudometric for Metric Labelled Transition Systems

       • Franck van Breugel

       Pages 141-155

   12. On Probabilistic Program Equivalence and Refinement

       • Andrzej S. Murawski, Joël Ouaknine

       Pages 156-170

   13. Probabilistic Anonymity

       • Mohit Bhargava, Catuscia Palamidessi

       Pages 171-185

   14. Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus

       • Andrew D. Gordon, Alan Jeffrey

       Pages 186-201

   15. Timed Spi-Calculus with Types for Secrecy and Authenticity

       • Christian Haack, Alan Jeffrey

       Pages 202-216

   16. Selecting Theories and Recursive Protocols

       • Tomasz Truderung

       Pages 217-232

This volume contains the papers presented at CONCUR 2005, the 16th - ternational Conference on Concurrency Theory. The purpose of the CONCUR series of conferences is to bring together researchers,developers, and students in order to advance the theory of concurrency and to promote its applications. This year’s conference was in San Francisco, California, from August 23 to August 26. We received 100 submissions in response to a call for papers. Each subm- sionwasassignedto at leastthreemembers ofthe ProgramCommittee; in many cases, reviews were solicited from outside experts. The ProgramCommittee d- cussed the submissions electronically, judging them on their perceived imp- tance, originality, clarity, and appropriateness to the expected audience. The Program Committee selected 38 papers for presentation. Because of the format of the conference and the high number of submissions, many good papers could not be included. Although submissions werereadand evaluated, the papers that appear in this volume may di?er in form and contents from the corresponding submissions. It is expected that many of the papers will be further revised and submitted to refereed archival journals for publication.

• algorithm
• algorithms
• concurrency
• distributed programming
• logic
• logic programming
• model checking
• petri net
• programming
• real-time
• semantics
• verification

• University of California, Santa Cruz

  Martín Abadi

• University of California, Santa Cruz, USA

  Luca Alfaro

Policies and ethics