Electronic Notes in Theoretical Computer Science, Volume 201

Volume 201, March 2008

• Eerke A. Boiten, John Derrick, Graeme Smith:
  Preface. 1
  
• Richard Banach, Gerhard Schellhorn:
  On the Refinement of Atomic Actions. 3-30
  
• Eerke A. Boiten, Dan Grundy:
  Reduction and Refinement. 31-44
  
• Neil Evans, Neil Grant:
  Towards the Formal Verification of a Java Processor in Event-B. 45-67
  
• Lindsay Groves:
  Trace-based Derivation of a Lock-Free Queue Algorithm. 69-98
  
• Arjan J. Mooij:
  Constructing and Reasoning About Security Protocols Using Invariants. 99-126
  
• Kazuhiro Ogata, Kokichi Futatsugi:
  Simulation-based Verification for Invariant Properties in the OTS/CafeOBJ Method. 127-154
  
• John Derrick, Graeme Smith:
  Using Model Checking to Automatically Find Retrieve Relations. 155-175
  
• Larissa Meinicke, Kim Solin:
  Refinement Algebra for Probabilistic Programs. 177-195
  
• Peter Höfner, Georg Struth:
  Can Refinement be Automated? 197-222
  
• Johanna Tuominen, Tomi Westerlund, Juha Plosila:
  Power Aware System Refinement. 223-253
  
• Heike Wehrheim:
  Refinement in the Presence of Unknowns. 255-264