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