Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=338
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Transition systems without transitions
Andrzej M. Borzyszkowski
,
Philippe Darondeau
Theoretical Computer Science
338
(1-3), 2005, pp. 1-16
A fully abstract may testing semantics for concurrent objects
Alan Jeffrey
,
Julian Rathke
Theoretical Computer Science
338
(1-3), 2005, pp. 17-63
An axiomatization of bisimulation quantifiers via the
\mu
-calculus
Giovanna D'Agostino
,
Giacomo Lenzi
Theoretical Computer Science
338
(1-3), 2005, pp. 64-95
On quasi-open bisimulation
Yuxi Fu
Theoretical Computer Science
338
(1-3), 2005, pp. 96-126
Ordering default theories and nonmonotonic logic programs
Chiaki Sakama
Theoretical Computer Science
338
(1-3), 2005, pp. 127-152
Modular verification of multithreaded programs
Cormac Flanagan
,
Stephen N. Freund
,
Shaz Qadeer
,
Sanjit A. Seshia
Theoretical Computer Science
338
(1-3), 2005, pp. 153-183
On the final sequence of a finitary set functor
James Worrell
Theoretical Computer Science
338
(1-3), 2005, pp. 184-199
A complexity analysis of functional interpretations
Mircea-Dan Hernest
,
Ulrich Kohlenbach
Theoretical Computer Science
338
(1-3), 2005, pp. 200-246
An
NP
decision procedure for protocol insecurity with XOR
Yannick Chevalier
,
Ralf Küsters
,
Michaël Rusinowitch
,
Mathieu Turuani
Theoretical Computer Science
338
(1-3), 2005, pp. 247-274
Simulation relations for alternating Büchi automata
Carsten Fritz
,
Thomas Wilke
Theoretical Computer Science
338
(1-3), 2005, pp. 275-314
Functions with local state: Regularity and undecidability
Andrzej S. Murawski
Theoretical Computer Science
338
(1-3), 2005, pp. 315-349
A translation of TPAL
_p
into a class of timed-probabilistic Petri nets
Antonio Bueno
,
Valentín Valero
,
Fernando Cuartero
Theoretical Computer Science
338
(1-3), 2005, pp. 350-392
A method for symbolic analysis of security protocols
Michele Boreale
,
Maria Grazia Buscemi
Theoretical Computer Science
338
(1-3), 2005, pp. 393-425