18. CONCUR 2007: Lisbon, Portugal

Invited Lectures

• Fred B. Schneider:
  Mapping the Security Landscape: A Role for Language Techniques. 1
  
• Luca Aceto, Anna Ingólfsdóttir:
  The Saga of the Axiomatization of Parallel Composition. 2-16
  
• Vincent Danos, Jérôme Feret, Walter Fontana, Russell Harmer, Jean Krivine:
  Rule-Based Modelling of Cellular Signalling. 17-41
  

Contributed Papers

• Konstantinos Chatzikokolakis, Catuscia Palamidessi:
  Making Random Choices Invisible to the Scheduler. 42-58
  
• Krishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman:
  Strategy Logic. 59-73
  
• Luca de Alfaro, Pritam Roy:
  Solving Games Via Three-Valued Abstraction Refinement. 74-89
  
• Martin Lange:
  Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness. 90-104
  
• Kim Guldstrand Larsen, Ulrik Nyman, Andrzej Wasowski:
  On Modal Refinement and Consistency. 105-119
  
• Taolue Chen, Bas Ploeger, Jaco van de Pol, Tim A. C. Willemse:
  Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems. 120-135
  
• Rohit Chadha, Mahesh Viswanathan:
  Decidability Results for Well-Structured Transition Systems with Auxiliary Storage. 136-150
  
• Luigi Santocanale:
  A Nice Labelling for Tree-Like Event Structures of Degree 3. 151-165
  
• Thomas Gazagnaire, Blaise Genest, Loïc Hélouët, P. S. Thiagarajan, Shaofa Yang:
  Causal Message Sequence Charts. 166-180
  
• S. Akshay, Madhavan Mukund, K. Narayan Kumar:
  Checking Coverage for Infinite Collections of Timed Scenarios. 181-196
  
• Michael Mendler, Gerald Lüttgen:
  Is Observational Congruence Axiomatisable in Equational Horn Logic? 197-211
  
• Cosimo Laneve, Luca Padovani:
  The Must Preorder Revisited. 212-225
  
• Sebastian Nanz, Flemming Nielson, Hanne Riis Nielson:
  Topology-Dependent Abstractions of Broadcast Networks. 226-240
  
• Cristian Versari, Nadia Busi, Roberto Gorrieri:
  On the Expressive Power of Global and Local Priority in Process Calculi. 241-255
  
• Viktor Vafeiadis, Matthew J. Parkinson:
  A Marriage of Rely/Guarantee and Separation Logic. 256-271
  
• Gérard Boudol:
  Fair Cooperative Multithreading. 272-286
  
• Peter Lammich, Markus Müller-Olm:
  Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures. 287-302
  
• Bow-Yaw Wang:
  Automatic Derivation of Compositional Rules in Automated Compositional Reasoning. 303-316
  
• Silvia Crafa, Daniele Varacca, Nobuko Yoshida:
  Compositional Event Structure Semantics for the Internal pi -Calculus. 317-332
  
• Thomas Ehrhard, Olivier Laurent:
  Interpreting a Finitary Pi-calculus in Differential Interaction Nets. 333-348
  
• Samuel Hym:
  Mobility Control Via Passports. 349-363
  
• Filippo Bonchi, Ugo Montanari:
  Coalgebraic Models for Reactive Systems. 364-379
  
• Davide Grohmann, Marino Miculan:
  Reactive Systems over Directed Bigraphs. 380-394
  
• Paul-André Melliès, Samuel Mimram:
  Asynchronous Games: Innocence Without Alternation. 395-411
  
• Martin R. Neuhäußer, Joost-Pieter Katoen:
  Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes. 412-427
  
• Tomás Brázdil, Vojtech Forejt:
  Strategy Synthesis for Markov Decision Processes and Branching-Time Logics. 428-444
  
• Thomas Brihaye, François Laroussinie, Nicolas Markey, Ghassan Oreiby:
  Timed Concurrent Game Structures. 445-459
  
• Benjamin Aminof, Aniello Murano, Moshe Y. Vardi:
  Pushdown Module Checking with Imperfect Information. 460-475
  
• Laura Bozzelli:
  Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages. 476-491
  
• Shoham Ben-David, Dana Fisman, Sitvanit Ruah:
  Temporal Antecedent Failure: Refining Vacuity. 492-506