Guarded commands, non-determinancy and a calculus for the derivation of programs

E.W. Dijkstra

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

15 Citations (Scopus)

Abstract

So-called "guarded commands" are introduced as a building block for alternative and repetitive constructs that allow non-deterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniquely determined by the initial state. For the formal derivation of programs expressed in terms of these constructs, a calculus will be shown.
Original languageEnglish
Title of host publicationLanguage Hierarchies and Interfaces (International Summer School, Marktoberdorf, Germany, July 23-August 2, 1975)
EditorsF.L. Bauer, K. Samelson
Place of PublicationBerlin
PublisherSpringer
Chapter2
Pages111-124
Number of pages14
ISBN (Electronic)978-3-540-37972-0
ISBN (Print)3-540-07994-7
DOIs
Publication statusPublished - 1976

Publication series

NameLecture Notes in Computer Science
Volume46
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Guarded commands, non-determinancy and a calculus for the derivation of programs'. Together they form a unique fingerprint.

Cite this