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=30
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Proving program inclusion using Hoare's logic
J.A. Bergstra
,
J.W. Klop
Theoretical Computer Science
30
(1), 1984, pp. 1-48
Correctness of programs with pascal-like procedures without global variables
E.-R. Olderog
Theoretical Computer Science
30
(1), 1984, pp. 49-90
Algbre de processus et synchronisation
D. Austry
,
G. Boudol
Theoretical Computer Science
30
(1), 1984, pp. 91-131
On MEIJE and SCCS: Infinite sum operators vs. non-guarded definitions
R. de Simone
Theoretical Computer Science
30
(1), 1984, pp. 133-138
A constructive method for abstract algebraic software specification
H.A. Klaeren
Theoretical Computer Science
30
(2), 1984, pp. 139-204
The solutions of two star-height problems for regular trees
J.P. Braquelaire
,
B. Courcelle
Theoretical Computer Science
30
(2), 1984, pp. 205-239
A theory of bipolar synchronication schemes
H.J. Genrich
,
P.S. Thiagarajan
Theoretical Computer Science
30
(3), 1984, pp. 241-318
The complexity of the satisfiability problem for Krom formulas
L. Denenberg
,
H.R. Lewis
Theoretical Computer Science
30
(3), 1984, pp. 319-341