15. CONCUR 2004: London, UK

Invited Papers

• Tony Andrews, Shaz Qadeer, Sriram K. Rajamani, Yichen Xie:
  Zing: Exploiting Program Structure for Model Checking Concurrent Software. 1-15
  
• Stephen D. Brookes:
  A Semantics for Concurrent Separation Logic. 16-34
  
• Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Mayank Saksena:
  A Survey of Regular Model Checking. 35-48
  
• Peter W. O'Hearn:
  Resources, Concurrency and Local Reasoning. 49-67
  

Accepted Papers

• Roberto M. Amadio, Silvano Dal-Zilio:
  Resource Control for Synchronous Cooperative Threads. 68-82
  
• Paolo Baldan, Andrea Corradini, Barbara König:
  Verifying Finite-State Graph Grammars: An Unfolding-Based Approach. 83-98
  
• Nicolas Baudru, Rémi Morin:
  The Pros and Cons of Netcharts. 99-114
  
• Martin Berger:
  Basic Theory of Reduction Congruence forTwo Timed Asynchronous pi-Calculi. 115-130
  
• Mikolaj Bojanczyk, Igor Walukiewicz:
  Characterizing EF and EX Tree Logics. 131-145
  
• Benedikt Bollig, Martin Leucker:
  Message-Passing Automata Are Expressively Equivalent to EMSO Logic. 146-160
  
• Johannes Borgström, Sébastien Briais, Uwe Nestmann:
  Symbolic Bisimulation in the Spi Calculus. 161-176
  
• Liana Bozga, Cristian Ene, Yassine Lakhnech:
  A Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps (Extended Abstract). 177-192
  
• Tomás Brázdil, Antonín Kucera, Oldrich Strazovský:
  Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems. 193-208
  
• Glenn Bruns, Radha Jagadeesan, Alan Jeffrey, James Riely:
  µABC: A Minimal Aspect Calculus. 209-224
  
• Michele Bugliesi, Dario Colazzo, Silvia Crafa:
  Type Based Discretionary Access Control. 225-239
  
• Luís Caires, Étienne Lozes:
  Elimination of Quantifiers and Undecidability in Spatial Logics for Concurrency. 240-257
  
• Corina Cîrstea, Dirk Pattinson:
  Modular Construction of Modal Logics. 258-275
  
• Edmund M. Clarke, Muralidhar Talupur, Tayssir Touili, Helmut Veith:
  Verification by Network Decomposition. 276-291
  
• Vincent Danos, Jean Krivine:
  Reversible Communicating Systems. 292-307
  
• Jan Friso Groote, Tim A. C. Willemse:
  Parameterised Boolean Equation Systems (Extended Abstract). 308-324
  
• Daniel Hirschkoff:
  An Extensional Spatial Logic for Mobile Processes. 325-339
  
• Pavel Krcál, Leonid Mokrushin, P. S. Thiagarajan, Wang Yi:
  Timed vs. Time-Triggered Automata. 340-354
  
• Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
  Extended Process Rewrite Systems: Expressiveness and Reachability. 355-370
  
• Antonín Kucera, Ph. Schnoebelen:
  A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. 371-386
  
• François Laroussinie, Nicolas Markey, Ph. Schnoebelen:
  Model Checking Timed Automata with One or Two Clocks. 387-401
  
• Jérôme Leroux, Grégoire Sutre:
  On Flatness for 2-Dimensional Vector Addition Systems with States. 402-416
  
• Qin Ma, Luc Maranget:
  Compiling Pattern Matching in Join-Patterns. 417-431
  
• Nicolas Markey, Jean-François Raskin:
  Model Checking Restricted Sets of Timed Paths. 432-447
  
• Paul-André Melliès:
  Asynchronous Games 2: The True Concurrency of Innocence. 448-465
  
• Paulo Tabuada:
  Open Maps, Alternating Simulations and Control Synthesis. 466-480
  
• Daniele Varacca, Hagen Völzer, Glynn Winskel:
  Probabilistic Event Structures and Domains. 481-496
  
• Vasco Thudichum Vasconcelos, António Ravara, Simon J. Gay:
  Session Types for Functional Multithreading. 497-511
  
• Mahesh Viswanathan, Ramesh Viswanathan:
  A Higher Order Modal Fixed Point Logic. 512-528