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=216
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Time-based expressivity of time Petri nets for system specification
Antonio Cerone
,
Andrea Maggiolo-Schettini
Theoretical Computer Science
216
(1-2), 1999, pp. 1-53
A behavioural theory of first-order CML
William Ferreira
,
Matthew Hennessy
Theoretical Computer Science
216
(1-2), 1999, pp. 55-107
From static to dynamic abstract data-types: An institution transformation
Elena Zucca
Theoretical Computer Science
216
(1-2), 1999, pp. 109-157
The reduced relative power operation on abstract domains
Roberto Giacobazzi
,
Francesco Ranzato
Theoretical Computer Science
216
(1-2), 1999, pp. 159-211
Formal verification of a programming logic for a distributed programming language
Cui Zhang
,
Ronald A. Olsson
,
Karl N. Levitt
Theoretical Computer Science
216
(1-2), 1999, pp. 213-235
Non-interleaving semantics for mobile processes
Pierpaolo Degano
,
Corrado Priami
Theoretical Computer Science
216
(1-2), 1999, pp. 237-270
A compositional
\mu
-calculus proof system for statecharts processes
Francesca Levi
Theoretical Computer Science
216
(1-2), 1999, pp. 271-310
Algebraic transformation of unary partial algebras II: Single-pushout approach
P. Burmeister
,
M. Monserrat
,
F. RossellĂ³
,
G. Valiente
Theoretical Computer Science
216
(1-2), 1999, pp. 311-362
Decidability of behavioural eqivalence in unary PCF
Manfred Schmidt-Schauss̀ˆ
Theoretical Computer Science
216
(1-2), 1999, pp. 363-373
Joining specification statements
K. Rustan M. Leino
,
Rajit Manohar
Theoretical Computer Science
216
(1-2), 1999, pp. 375-394
A shorter proof to uniqueness of solutions of equations
Mingsheng Ying
Theoretical Computer Science
216
(1-2), 1999, pp. 395-397