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: Author="Hoare, C.A.R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Graphical models of separation logic
Ian Wehrman
,
C.A.R. Hoare
,
Peter W. O'Hearn
Information Processing Letters
109
(17), 2009, pp. 1001-1004
Assertions: A personal perspective
C.A.R. Hoare
Software Pioneers - Contributions to Software Engineering, 2002, pp. 356-366
An axiomatic basis for computer programming
C.A.R. Hoare
Software Pioneers - Contributions to Software Engineering, 2002, pp. 367-383
Proof of correctness of data representations
C.A.R. Hoare
Software Pioneers - Contributions to Software Engineering, 2002, pp. 385-396
An axiomatic basis for computer programming
C.A.R. Hoare
Pioneers and Their Contributions to Software Engineering - sd&m Conference on Software Pioneers (Bonn, Germany, June 28-29, 2001), 2001, pp. 421-438
Proof of correctness of data representations
C.A.R. Hoare
Pioneers and Their Contributions to Software Engineering - sd&m Conference on Software Pioneers (Bonn, Germany, June 28-29, 2001), 2001, pp. 441-451
A trace model for pointers and objects
C.A.R. Hoare
,
Jifeng He
misc, 1998
Unifying theories of programming
C.A.R. Hoare
Technical Report (5), 1998
Sequential calculus
Burghard von Karger
,
C.A.R. Hoare
Information Processing Letters
53
, 1995, pp. 123-130
Normal form approach to compiler design
C.A.R. Hoare
,
He Jifeng
,
A. Sampaio
Acta Informatica
30
, 1993, pp. 701-739
From algebra to operational semantics
He Jifeng
,
C.A.R. Hoare
Information Processing Letters
45
(2), 1993, pp. 75-80
A theory for the derivation of combinational C-MOS circuit designs
C.A.R. Hoare
Theoretical Computer Science
90
, 1991, pp. 235-251
A calculus of durations
Chaochen Zhou
,
C.A.R. Hoare
,
Anders P. Ravn
Information Processing Letters
40
, 1991, pp. 269-276
Fixed points of increasing functions
C.A.R. Hoare
Information Processing Letters
34
, 1990, pp. 111-112
The laws of Occam programming
A.W. Roscoe
,
C.A.R. Hoare
Theoretical Computer Science
60
, 1988, pp. 177-229
Prespecification in data refinement
C.A.R. Hoare
,
Jifeng He
,
J.W. Sanders
Information Processing Letters
25
(2), 1987, May, pp. 71-76
The weakest prespecification
C.A.R. Hoare
,
Jifeng He
Information Processing Letters
24
(2), 1987, January, pp. 127-132
Specification-oriented semantics for communicating processes
E.-R. Olderog
,
C.A.R. Hoare
Acta Informatica
23
(1), 1986, pp. 9-66
A theory of communicating sequential processes
S.D. Brookes
,
C.A.R. Hoare
,
A.W. Roscoe
Journal of the ACM
31
(3), 1984, pp. 560-599
A theory of communicating sequential processes
S.D. Brookes
,
C.A.R. Hoare
,
A.W. Roscoe
Technical Report (CMU-CS-83-153), 1983
A more complete model of communicating processes
E.C.R. Hehner
,
C.A.R. Hoare
Theoretical Computer Science
26
(1,2), 1983, pp. 105-120
A theory of nondeterminism
J.R. Kennaway
,
C.A.R. Hoare
Lecture Notes in Computer Science
85
, 1980, pp. 338-350
Semantics of nondeterminism, concurrency, and communication
N. Francez
,
C.A.R. Hoare
,
D.J. Lehmann
,
W.P. de Roever
Journal of Computer and System Sciences
19
(3), 1979, December, pp. 290-308
Semantics of nondeterminism, concurrency and communication
Nissim Francez
,
C.A.R. Hoare
,
Willem P. de Roever
Lecture Notes in Computer Science
64
, 1978, pp. 191-200
Some properties of predicate transformers
C.A.R. Hoare
Journal of the ACM
25
, 1978, pp. 461-480
Seiten 1
2
>