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=177
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A representable approach to finite nondeterminism
S.O. Anderson
,
A.J. Power
Theoretical Computer Science
177
(1), 1997, pp. 3-25
A general adequacy result for a linear functional language
Torben Braüner
Theoretical Computer Science
177
(1), 1997, pp. 27-58
Degrees of parallelism in the continuous type hierarchy
Antonio Bucciarelli
Theoretical Computer Science
177
(1), 1997, pp. 59-71
Constructing process categories
J.R.B. Cockett
,
David A. Spooner
Theoretical Computer Science
177
(1), 1997, pp. 73-109
Continuity spaces: Reconciling domains and metric spaces
Bob Flagg
,
Ralph Kopperman
Theoretical Computer Science
177
(1), 1997, pp. 111-138
Abstract fairness and semantics
Doris Nolte
,
Lutz Priese
Theoretical Computer Science
177
(1), 1997, pp. 139-153
Defaults in domain theory
Guo-Qiang Zhang
,
William C. Rounds
Theoretical Computer Science
177
(1), 1997, pp. 155-182
The behavior-realization adjunction and generalized homomorphic relations
Gray T. Leavens
,
Don Pigozzi
Theoretical Computer Science
177
(1), 1997, pp. 183-216
Completeness of Park induction
Z. Ésik
Theoretical Computer Science
177
(1), 1997, pp. 217-283
The algebra of communicating processes with empty process
J.L.M. Vrancken
Theoretical Computer Science
177
(2), 1997, pp. 287-328
Notes on the methodology of CCS and CSP
R.J. van Glabbeek
Theoretical Computer Science
177
(2), 1997, pp. 329-349
A general conservative extension theorem in process algebras with inequalities
Pedro R. D'Argenio
,
Chris Verhoef
Theoretical Computer Science
177
(2), 1997, pp. 351-380
Process algebra with propositional signals
J.C.M. Baeten
,
J.A. Bergstra
Theoretical Computer Science
177
(2), 1997, pp. 381-405
Termination modulo equations by abstract commutation with an application to iteration
Wan Fokkink
,
Hans Zantema
Theoretical Computer Science
177
(2), 1997, pp. 407-423
Process algebra with language matching
Jos van Wamel
Theoretical Computer Science
177
(2), 1997, pp. 425-458
Formal verification of a leader election protocol in process algebra
Lars-åke Fredlund
,
Jan Friso Groote
,
Henri Korver
Theoretical Computer Science
177
(2), 1997, pp. 459-486
Two finite specifications of a queue
Marc Bezem
,
Alban Ponse
Theoretical Computer Science
177
(2), 1997, pp. 487-507