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