16. CONCUR 2005: San Francisco, CA, USA

Invited Lectures

• Dawson R. Engler:
  Static Analysis Versus Model Checking for Bug Finding. 1
  
• Rajeev Alur:
  The Benefits of Exposing Calls and Returns. 2-3
  
• Luca Cardelli:
  A Compositional Approach to the Stochastic Dynamics of Gene Networks. 4
  

Contributed Papers

• Christos H. Papadimitriou:
  Games Other People Play. 5
  
• Deepak Garg, Frank Pfenning:
  Type-Directed Concurrency. 6-20
  
• Damiano Mazza:
  Multiport Interaction Nets and Concurrency. 21-35
  
• Alwen Fernanto Tiu:
  Model Checking for pi-Calculus Using Proof Search. 36-50
  
• Jim Laird:
  A Game Semantics of the Asynchronous pi-Calculus. 51-65
  
• Franck Cassez, Alexandre David, Emmanuel Fleury, Kim Guldstrand Larsen, Didier Lime:
  Efficient On-the-Fly Algorithms for the Analysis of Timed Games. 66-80
  
• Patricia Bouyer, Franck Cassez, François Laroussinie:
  Modal Logics for Timed Control. 81-94
  
• Catalin Dima:
  Timed Shuffle Expressions. 95-109
  
• Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie:
  A New Modality for Almost Everywhere Properties in Timed Automata. 110-124
  
• Pedro R. D'Argenio, Biniam Gebremichael:
  The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation. 125-140
  
• Franck van Breugel:
  A Behavioural Pseudometric for Metric Labelled Transition Systems. 141-155
  
• Andrzej S. Murawski, Joël Ouaknine:
  On Probabilistic Program Equivalence and Refinement. 156-170
  
• Mohit Bhargava, Catuscia Palamidessi:
  Probabilistic Anonymity. 171-185
  
• Andrew D. Gordon, Alan Jeffrey:
  Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus. 186-201
  
• Christian Haack, Alan Jeffrey:
  Timed Spi-Calculus with Types for Secrecy and Authenticity. 202-216
  
• Tomasz Truderung:
  Selecting Theories and Recursive Protocols. 217-232
  
• Detlef Kähler, Ralf Küsters:
  Constraint Solving for Contract-Signing Protocols. 233-247
  
• Jos C. M. Baeten, Mario Bravetti:
  A Ground-Complete Axiomatization of Finite State Processes in Process Algebra. 248-262
  
• Sibylle B. Fröschle, Slawomir Lasota:
  Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP. 263-277
  
• David de Frutos-Escrig, Carlos Gregorio-Rodríguez:
  Bisimulations Up-to for the Linear Time Branching Time Spectrum. 278-292
  
• Roberto Bruni, Fabio Gadducci, Ugo Montanari, Pawel Sobocinski:
  Deriving Weak Bisimulation Congruences from Reduction Systems. 293-307
  
• Mohammad Reza Mousavi, Murdoch Gabbay, Michel A. Reniers:
  SOS for Higher Order Processes. 308-322
  
• Rob J. van Glabbeek:
  The Individual and Collective Token Interpretations of Petri Nets. 323-337
  
• Victor Khomenko, Alex Kondratyev, Maciej Koutny, Walter Vogler:
  Merged Processes - A New Condensed Representation of Petri Net Behaviour. 338-352
  
• Vijay A. Saraswat, Radha Jagadeesan:
  Concurrent Clustered Programming. 353-367
  
• Adrian Francalanza, Matthew Hennessy:
  A Theory of System Behaviour in the Presence of Node and Link Failures. 368-382
  
• Roberto Bruni, Michael J. Butler, Carla Ferreira, C. A. R. Hoare, Hernán C. Melgratti, Ugo Montanari:
  Comparing Two Approaches to Compensable Flow Composition. 383-397
  
• Vincent Danos, Jean Krivine:
  Transactions in RCCS. 398-412
  
• Krishnendu Chatterjee:
  Two-Player Nonzero-Sum omega-Regular Games. 413-427
  
• Hugo Gimbert, Wieslaw Zielonka:
  Games Where You Can Play Optimally Without Any Memory. 428-442
  
• Blaise Genest:
  On Implementation of Global Concurrent Systems with Local Asynchronous Controllers. 443-457
  
• Hagen Völzer, Daniele Varacca, Ekkart Kindler:
  Defining Fairness. 458-472
  
• Ahmed Bouajjani, Markus Müller-Olm, Tayssir Touili:
  Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems. 473-487
  
• Aaron R. Bradley, Zohar Manna, Henny B. Sipma:
  Termination Analysis of Integer Linear Loops. 488-502
  
• Eric Goubault, Emmanuel Haucourt:
  A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs. 503-517
  
• Stéphane Demri, Régis Gascon:
  Verification of Qualitative Constraints. 518-532
  
• Paul Gastin, Dietrich Kuske:
  Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces. 533-547
  
• Tiziana Margaria, A. Prasad Sistla, Bernhard Steffen, Lenore D. Zuck:
  Taming Interface Specifications. 548-561
  
• Ron van der Meyden, Thomas Wilke:
  Synthesis of Distributed Systems from Knowledge-Based Specifications. 562-576
  

Last update Wed Feb 15 04:57:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page