Electronic Notes in Theoretical Computer Science, Volume 158

Volume 158, May 2006

• Steve Brookes, Michael W. Mislove:
  Preface. 1-2
  
• Patricia Bouyer:
  Weighted Timed Automata: Model-Checking and Games. 3-17
  
• Rohit Chadha, Paulo Mateus, Amílcar Sernadas:
  Reasoning About Imperative Quantum Programs. 19-39
  
• Adam Antonik, Michael Huth:
  Efficient Patterns for Model Checking Partial State Spaces in CTL intersection LTL. 41-57
  
• Ingo Battenfeld:
  Computational Effects in Topological Domain Theory. 59-80
  
• Josh Berdine, Peter W. O'Hearn:
  Strong Update, Disposal, and Encapsulation in Bunched Typing. 81-98
  
• Eduardo Bonelli:
  The Linear Logical Abstract Machine. 99-121
  
• Stephen D. Brookes:
  Variables as Resource for Shared-Memory Programs: Semantics and Soundness. 123-150
  
• Daniela Cancila, Furio Honsell, Marina Lenisa:
  Functors Determined by Values on Objects. 151-169
  
• Matthew Collinson, David J. Pym:
  Bunching for Regions and Locations. 171-197
  
• Mohamed A. El-Zawawy, Achim Jung:
  Priestley Duality for Strong Proximity Lattices. 199-217
  
• Chris Heunen, Bart Jacobs:
  Arrows, like Monads, are Monoids. 219-236
  
• Weng Kin Ho:
  An Operational Domain-theoretic Treatment of Recursive Types. 237-259
  
• Paul Blain Levy:
  Monads and Adjunctions for Global Exceptions. 261-287
  
• Keye Martin, Ira S. Moskowitz, Gerard Allwein:
  Algebraic Information Theory For Binary Channels. 289-306
  
• Massimo Merro, Corrado Biasi:
  On the Observational Theory of the CPS-calculus: (Extended Abstract). 307-330
  
• Nicola Mezzetti, Davide Sangiorgi:
  Towards a Calculus For Wireless Systems. 331-353
  
• John Power:
  Semantics for Local Computational Effects. 355-371
  
• Daniele Varacca, Nobuko Yoshida:
  Typed Event Structures and the pi-Calculus: Extended Abstract. 373-397
  
• Uri Zarfaty, Philippa Gardner:
  Local Reasoning About Tree Update. 399-424