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=253
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Refinement of time
Manfred Broy
Theoretical Computer Science
253
(1), 2001, pp. 3-26
Deductive verification of real-time systems using STeP
Nikolaj S. Bjrner
,
Zohar Manna
,
Henny B. Sipma
,
Tomás E. Uribe
Theoretical Computer Science
253
(1), 2001, pp. 27-60
PLC-automata: A new class of implementable real-time automata
Henning Dierks
Theoretical Computer Science
253
(1), 2001, pp. 61-93
The Verus language: Representing time efficiently with BDDs
Sérgio Vale Aguiar Campos
,
Edmund Clarke
Theoretical Computer Science
253
(1), 2001, pp. 95-118
Verification, refinement and scheduling of real-time programs
Zhiming Liu
,
Mathai Joseph
Theoretical Computer Science
253
(1), 2001, pp. 119-152
Names of the
\pi
-calculus agents handled locally
Chiara Bodei
,
Pierpaolo Degano
,
Corrado Priami
Theoretical Computer Science
253
(2), 2001, pp. 155-184
Proof nets, garbage, and computations
Stefano Guerrini
,
Simone Martini
,
Andrea Masini
Theoretical Computer Science
253
(2), 2001, pp. 185-237
\pi
-calculus in (Co)inductive-type theory
Furio Honsell
,
Marino Miculan
,
Ivan Scagnetto
Theoretical Computer Science
253
(2), 2001, pp. 239-285
Measure and probability for concurrency theorists
Prakash Panangaden
Theoretical Computer Science
253
(2), 2001, pp. 287-309
Asynchronous process calculi: The first- and higher-order paradigms
D. Sangiorgi
Theoretical Computer Science
253
(2), 2001, pp. 311-350