Theoretical Computer Science, Volume 353

Volume 353, Numbers 1-3, 14 March 2006

• Lutz Schröder:
  The HASCASL prologue: Categorical syntax and semantics of the partial lambda-calculus. 1-25
  
• Zhaohui Zhu:
  Similarity between preferential models. 26-52
  
• Sven Hartmann, Sebastian Link:
  On a problem of Fagin concerning multivalued dependencies in relational databases. 53-62
  
• Wenhui Zhang:
  Structure of proofs and the complexity of cut elimination. 63-70
  
• Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis:
  Automatic workflow verification and generation. 71-92
  
• Valentin Goranko, Govert van Drimmelen:
  Complete axiomatization and decidability of Alternating-time temporal logic. 93-117
  
• John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague:
  A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols. 118-164
  
• Norihiro Kamide:
  Linear and affine logics with temporal, spatial and epistemic operators. 165-207
  
• Hanifa Boucheneb, Rachid Hadjidj:
  CTL^* model checking for time Petri nets. 208-227
  
• Natalia López, Manuel Núñez, Ismael Rodríguez:
  Specification, testing and implementation relations for symbolic-probabilistic systems. 228-248
  
• François Laroussinie, Nicolas Markey, Ph. Schnoebelen:
  Efficient timed model checking for discrete-time systems. 249-271
  
• Mark Kambites:
  Automatic semigroups and categories. 272-290
  
• Florentin Ipate:
  Testing against a non-controllable stream X-machine using state counting. 291-316