Zobrazeno 1 - 10
of 15
pro vyhledávání: '"W.H.J. Feijen"'
Autor:
W.H.J. Feijen, A.J.M. van Gasteren
Among all the interests in parallelism, there is an essential and fundamental one that has remained largely unexplored, namely the question of how to design parallel programs from their specification. And that is what this book is about. It proposes
More than anything else, this book is a tribute to Edsger W. Dijkstra, on the occasion of his sixtieth birthday, by just a few of those fortunate enough to be influenced by him and his work and to be called his friend or relation, his master, colleag
Autor:
H. Richards, W.H.J. Feijen, Jayadev Misra, C. A. R. Hoare, David Gries, J. Moore, R. S. Boyer
Publikováno v:
Communications of the ACM, 45(10), 21-22. Association for Computing Machinery, Inc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::092119517eb6c8387fe5cb88ad74673b
https://research.tue.nl/nl/publications/5ca1bed6-0f43-474a-9112-98988c87f424
https://research.tue.nl/nl/publications/5ca1bed6-0f43-474a-9112-98988c87f424
Publikováno v:
Beauty Is Our Business
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ffdf7956b0b06f36c7e2c224e8035be1
https://doi.org/10.1007/978-1-4612-4476-9
https://doi.org/10.1007/978-1-4612-4476-9
Autor:
W.H.J. Feijen
Publikováno v:
Beauty Is Our Business ISBN: 9781461287926
In this note we record an experiment in deriving multiprograms from their functional specifications, with the predicate calculus and the theory of Owicki and Gries as our only tools for reasoning. For the benefit of the experiment we have selected an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::765da32c8d713e2682b9ec596a1496d0
https://doi.org/10.1007/978-1-4612-4476-9_14
https://doi.org/10.1007/978-1-4612-4476-9_14
Publikováno v:
Beauty is our Business.
Publikováno v:
Beauty Is Our Business ISBN: 9781461287926
We consider a connected undirected graph. Its node set S is finite and contains at least two elements; its edge set is finite. There are no further restrictions on the topology of the graph; in particular it may contain multiple edges and autoloops.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54a773e8a4ee13d999a205affdb88535
https://doi.org/10.1007/978-1-4612-4476-9_13
https://doi.org/10.1007/978-1-4612-4476-9_13
Publikováno v:
Information Processing Letters, 16(5), 217-219. Elsevier
The purpose of this paper is twofold, viz. to present a new [0] algorithm for the detection of the termination of a distributed computation and to demonstrate how the algorithm can be derived in a number of steps.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.