Volume 138, Number 1, 9 September 2005

Proceedings of the Workshop on the Foundations of Global Ubiquitous Computing (FGUC 2004)

• 
  Julian Rathke: Preface. 1
• 
  Eduardo Bonelli, Adriana B. Compagnoni, Elsa L. Gunter: Typechecking Safe Process Synchronization. 3-22
• 
  Daniele Gorla, Matthew Hennessy, Vladimiro Sassone: Security Policies as Membranes in Systems for Global Computing. 23-42
• 
  Ivan Lanese, Ugo Montanari: Synchronization Algebras with Mobility for Graph Transformations. 43-60
• 
  Yongjian Li: Contextual Labelled Semantics for Higher-order Process Calculi. 61-77
• 
  Alwen Fernanto Tiu, Dale Miller: A Proof Search Specification of the pi-Calculus. 79-101

Volume 138, Number 2, 23 November 2005

Proceedings of the Second Workshop on Object Oriented Developments (WOOD 2004)

• 
  Viviana Bono, Michele Bugliesi, Sophia Drossopoulou: Preface. 1-2
• 
  Davide Ancona, Sonia Fagorzi, Elena Zucca: A Calculus for Dynamic Reconfiguration with Low Priority Linking. 3-35
• 
  Christopher Anderson, Paola Giannini: Type Checking for JavaScript. 37-58
• 
  Lorenzo Bettini, Sara Capecchi, Betti Venneri: Translating Double Dispatch into Single Dispatch. 59-78
• 
  Johan Glimming, Neil Ghani: Difunctorial Semantics of Object Calculus. 79-94
• 
  Mirko Viroli: Effective and Efficient Compilation of Run-Time Generics in Java. 95-116
• 
  Stephanie Weirich, Liang Huang: A Design for Type-Directed Programming in Java. 117-136

Volume 138, Number 3, 28 December 2005

Proceedings of the 6th International Workshop on Verification of Infinite-State Systems (INFINITY 2004)

• 
  Julian C. Bradfield, Faron Moller: Preface. 1
• 
  Ranko Lazic: Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification. 3-19
• 
  Peter Habermehl, Tomás Vojnar: Regular Model Checking Using Inference of Regular Languages. 21-36
• 
  Jesse D. Bingham: A New Approach to Upward-Closed Set Backward Reachability Analysis. 37-48
• 
  Martin Kot, Zdenek Sawa: Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time. 49-60
• 
  Ranko Lazic, Thomas Christopher Newcomb, Bill Roscoe: Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting. 61-86
• 
  Olga Grinchtein, Bengt Jonsson, Martin Leucker: Inference of Timed Transition Systems. 87-99
• 
  Ahmed Bouajjani, Axel Legay, Pierre Wolper: Handling Liveness Properties in (omega-)Regular Model Checking. 101-115
• 
  Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata: Closed, Open, and Robust Timed Networks. 117-151
• 
  Ahmed Bouajjani, Javier Esparza, Tayssir Touili: Reachability Analysis of Synchronized PA Systems. 153-178