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=300
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Infinite trees and completely iterative theories: A coalgebraic view
Peter Aczel
,
Jiȓí Adámek
,
Stefan Milius
,
Jiȓí Velebil
Theoretical Computer Science
300
(1-3), 2003, pp. 1-45
Presheaf models for CCS-like languages
Gian Luca Cattani
,
Glynn Winskel
Theoretical Computer Science
300
(1-3), 2003, pp. 47-89
A new framework for declarative programming
Stacy E. Finkelstein
,
Peter Freyd
,
James Lipton
Theoretical Computer Science
300
(1-3), 2003, pp. 91-160
On the non-termination of
M_{DG}
-based abstract state enumeration
Otmane Aït Mohamed
,
Xiaoyu Song
,
Eduard Cerny
Theoretical Computer Science
300
(1-3), 2003, pp. 161-179
Induction in the Timed Interval Calculus
Axel Wabenhorst
Theoretical Computer Science
300
(1-3), 2003, pp. 181-207
Intersection of finitely generated congruences over term algebra
Sándor Vágvölgyi
Theoretical Computer Science
300
(1-3), 2003, pp. 209-234
A polynomial space construction of tree-like models for logics with local chains of modal connectives
Stéphane Demri
Theoretical Computer Science
300
(1-3), 2003, pp. 235-258
General parameterised refinement and recursion for the
M
-net calculus
Raymond Devillers
,
Hanna Klaudel
,
Robert-C. Riemann
Theoretical Computer Science
300
(1-3), 2003, pp. 259-300
Decision procedures for inductive Boolean functions based on alternating automata
Abdelwaheb Ayari
,
David Basin
,
Felix Klaedtke
Theoretical Computer Science
300
(1-3), 2003, pp. 301-329
Automata over continuous time
Alexander Rabinovich
Theoretical Computer Science
300
(1-3), 2003, pp. 331-363
A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem
Lorenzo Carlucci
Theoretical Computer Science
300
(1-3), 2003, pp. 365-378
Typing correspondence assertions for communication protocols
Andrew D. Gordon
,
Alan Jeffrey
Theoretical Computer Science
300
(1-3), 2003, pp. 379-409
The power of reachability testing for timed automata
Luca Aceto
,
Patricia Bouyer
,
Augusto Burgueño
,
Kim G. Larsen
Theoretical Computer Science
300
(1-3), 2003, pp. 411-475
Decidability results for primitive recursive algorithms
R. David
Theoretical Computer Science
300
(1-3), 2003, pp. 477-504