Theoretical Computer Science, Volume 338

Volume 338, Number 1-3, June 2005

• Andrzej M. Borzyszkowski, Philippe Darondeau:
  Transition systems without transitions. 1-16
  Electronic Edition (link) BibTeX
• Alan Jeffrey, Julian Rathke:
  A fully abstract may testing semantics for concurrent objects. 17-63
  Electronic Edition (link) BibTeX
• Giovanna D'Agostino, Giacomo Lenzi:
  An axiomatization of bisimulation quantifiers via the mu-calculus. 64-95
  Electronic Edition (link) BibTeX
• Yuxi Fu:
  On quasi-open bisimulation. 96-126
  Electronic Edition (link) BibTeX
• Chiaki Sakama:
  Ordering default theories and nonmonotonic logic programs. 127-152
  Electronic Edition (link) BibTeX
• Cormac Flanagan, Stephen N. Freund, Shaz Qadeer, Sanjit A. Seshia:
  Modular verification of multithreaded programs. 153-183
  Electronic Edition (link) BibTeX
• James Worrell:
  On the final sequence of a finitary set functor. 184-199
  Electronic Edition (link) BibTeX
• Mircea-Dan Hernest, Ulrich Kohlenbach:
  A complexity analysis of functional interpretations. 200-246
  Electronic Edition (link) BibTeX
• Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani:
  An NP decision procedure for protocol insecurity with XOR. 247-274
  Electronic Edition (link) BibTeX
• Carsten Fritz, Thomas Wilke:
  Simulation relations for alternating Büchi automata. 275-314
  Electronic Edition (link) BibTeX
• Andrzej S. Murawski:
  Functions with local state: Regularity and undecidability. 315-349
  Electronic Edition (link) BibTeX
• Antonio Bueno, Valentín Valero Ruiz, Fernando Cuartero:
  A translation of TPAL_p into a class of timed-probabilistic Petri nets. 350-392
  Electronic Edition (link) BibTeX
• Michele Boreale, Maria Grazia Buscemi:
  A method for symbolic analysis of security protocols. 393-425
  Electronic Edition (link) BibTeX