So-called "guarded commands " are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniqilely determined by the initial state. For the formal derivation of programs expressed in terms of these constructs, a calculus will be be shown. Key Words and Phrases: programming languages, sequencing primitives, program semantics, programming language semantics, nondeterminacy, case-construction, repetition, termination, correctness proof, derivation of programs, programming methodolog
A large part of the effort in formal program developments is expended on repeating the same derivati...
AbstractWe describe a language of specified programs devised to form a basis for a system for the de...
Existing refinement calculi provide frameworks for the stepwise development of imperative programs f...
So-called "guarded commands" are introduced as a building block for alternative and repetitive const...
So-called "guarded commands" are introduced as a building block for alternative and repetitive const...
AbstractFor an arbitrary programming language with nondeterminism to be implementable, the existence...
AbstractA uniform treatment of specifications, programs, and programming is presented. The treatment...
The syntactic theories of control and state are conservative extensions of the λv-calculus for equat...
We discuss some approaches to declarative programming including functional programming, various logi...
A complete set of algebraic laws is given for E. W. Dijkstra's nondeterministic sequential programmi...
Automatic program verification tools have to cope with program-ming language and machine semantics, ...
A complete set of algebraic laws is given for Dijkstra's nondeterministic sequential programming lan...
AbstractTotal correctness and general correctness are examined, and the latter is promoted as the mo...
50 pagesRelying on the formulae-as-types paradigm for classical logic, we define a program logic for...
Dijkstra's language of guarded commands is extended with recursion and transformed into algebra. The...
A large part of the effort in formal program developments is expended on repeating the same derivati...
AbstractWe describe a language of specified programs devised to form a basis for a system for the de...
Existing refinement calculi provide frameworks for the stepwise development of imperative programs f...
So-called "guarded commands" are introduced as a building block for alternative and repetitive const...
So-called "guarded commands" are introduced as a building block for alternative and repetitive const...
AbstractFor an arbitrary programming language with nondeterminism to be implementable, the existence...
AbstractA uniform treatment of specifications, programs, and programming is presented. The treatment...
The syntactic theories of control and state are conservative extensions of the λv-calculus for equat...
We discuss some approaches to declarative programming including functional programming, various logi...
A complete set of algebraic laws is given for E. W. Dijkstra's nondeterministic sequential programmi...
Automatic program verification tools have to cope with program-ming language and machine semantics, ...
A complete set of algebraic laws is given for Dijkstra's nondeterministic sequential programming lan...
AbstractTotal correctness and general correctness are examined, and the latter is promoted as the mo...
50 pagesRelying on the formulae-as-types paradigm for classical logic, we define a program logic for...
Dijkstra's language of guarded commands is extended with recursion and transformed into algebra. The...
A large part of the effort in formal program developments is expended on repeating the same derivati...
AbstractWe describe a language of specified programs devised to form a basis for a system for the de...
Existing refinement calculi provide frameworks for the stepwise development of imperative programs f...