


default search action
Theoretical Computer Science, Volume 338
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

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














