Theoretical Computer Science, Volume 336

Volume 336, Number 1, May 2005

• Maurizio Lenzerini:
  Preface. 1-
  
• Michael Benedikt, Wenfei Fan, Gabriel M. Kuper:
  Structural properties of XPath fragments. 3-31
  
• Diego Calvanese, Giuseppe De Giacomo, Moshe Y. Vardi:
  Decidable containment of recursive queries. 33-56
  
• Alin Deutsch, Val Tannen:
  XML queries and constraints, containment and reformulation. 57-87
  
• Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa:
  Data exchange: semantics and query answering. 89-124
  
• Floris Geerts, Bart Kuijpers:
  On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases. 125-151
  
• Wim Martens, Frank Neven:
  On the complexity of typechecking top-down XML transformations. 153-180
  
• David Toman, Grant E. Weddell:
  On reasoning about structural equality in XML: a description logic approach. 181-203
  

Volume 336, Number 2-3, May 2005

• Egon Börger:
  Abstract state machines and high-level system design and analysis. 205-207
  
• Cyrille Artho, Howard Barringer, Allen Goldberg, Klaus Havelund, Sarfraz Khurshid, Michael R. Lowry, Corina S. Pasareanu, Grigore Rosu, Koushik Sen, Willem Visser, Richard Washington:
  Combining test case generation and runtime verification. 209-234
  
• Egon Börger, Nicu G. Fruja, Vincenzo Gervasi, Robert F. Stärk:
  A high-level modular definition of the semantics of C#. 235-284
  
• Uwe Glässer, Qian-Ping Gu:
  Formal description and analysis of a distributed location service for mobile ad hoc networks. 285-309
  
• Yuri Gurevich, Nikolai Tillmann:
  Partial updates. 311-342
  
• Stanislas Nanchen, Robert F. Stärk:
  A logic for secure memory access of abstract state machines. 343-365
  
• Gruia-Catalin Roman, Jamie Payton:
  A principled exploration of coordination models. 367-401
  
• Gerhard Schellhorn:
  ASM refinement and generalizations of forward simulation in data refinement: a comparison. 403-435