Add to ORKGThe purpose of this paper is to discuss the relevance of nondeterminism in computer science, with a special emphasis on Dijkstra's guarded commands language.Comment: 34 pages. This is authors' version of Chapter 8 of the book K.R. Apt and C.A.R. Hoare (editors), Edsger Wybe Dijkstra: His Life, Work, and Legacy, volume 45 of ACM Books. ACM/Morgan & Claypool, 202
International audienceHistory-deterministic automata are an intermediate automata model, in between ...
"Nondeterminism in Algebraic Specifications and Algebraic Programs" presents a mathematical theory f...
AbstractPROLOG and its variants are based on SLD resolution, which uses “don't know” nondeterminism ...
Dijkstra's language of guarded commands is extended with recursion and transformed into algebra. The...
AbstractFor an arbitrary programming language with nondeterminism to be implementable, the existence...
from Richard W. Hamming collection (NPS-018), Naval Postgraduate School. Papers and Speeches
We study three levels in a hierarchy of nondeterminism: A nondeterministic automaton $\cal A$ is det...
Computer programs need to deal with nondeterministic environments. This nondeterminism may arise fro...
As explained in Chapter 1, Dijkstra’s guarded-command language, which we call GCL, was introduced as...
So-called "guarded commands " are introduced as a building block for alternative a...
So-called guarded commands are introduced as a building block for alternative and repetitive const...
A language is constructed that supports arbitrary atomic statements, composition, alternatives, and ...
The diagonalization technique was invented by Georg Cantor to show that there are more real numbers ...
Nondeterminism is typically used as an inherent part of the computational models used incomputationa...
International audienceHistory-deterministic automata are an intermediate automata model, in between ...
"Nondeterminism in Algebraic Specifications and Algebraic Programs" presents a mathematical theory f...
AbstractPROLOG and its variants are based on SLD resolution, which uses “don't know” nondeterminism ...
Dijkstra's language of guarded commands is extended with recursion and transformed into algebra. The...
AbstractFor an arbitrary programming language with nondeterminism to be implementable, the existence...
from Richard W. Hamming collection (NPS-018), Naval Postgraduate School. Papers and Speeches
We study three levels in a hierarchy of nondeterminism: A nondeterministic automaton $\cal A$ is det...
Computer programs need to deal with nondeterministic environments. This nondeterminism may arise fro...
As explained in Chapter 1, Dijkstra’s guarded-command language, which we call GCL, was introduced as...
So-called "guarded commands " are introduced as a building block for alternative a...
So-called guarded commands are introduced as a building block for alternative and repetitive const...
A language is constructed that supports arbitrary atomic statements, composition, alternatives, and ...
The diagonalization technique was invented by Georg Cantor to show that there are more real numbers ...
Nondeterminism is typically used as an inherent part of the computational models used incomputationa...
International audienceHistory-deterministic automata are an intermediate automata model, in between ...
"Nondeterminism in Algebraic Specifications and Algebraic Programs" presents a mathematical theory f...
AbstractPROLOG and its variants are based on SLD resolution, which uses “don't know” nondeterminism ...