Hierarchical ordering of sequential processes

  title={Hierarchical ordering of sequential processes},
  author={E. Dijkstra},
  journal={Acta Informatica},
  • E. Dijkstra
  • Published 2004
  • Computer Science
  • Acta Informatica
SummaryOne of the primary functions of an operating system is to rebuild a machine that must be regarded as non-deterministic (on account of cycle stealing and interrupts) into a more or less deterministic automaton. Taming the degree of indeterminacy in steps will lead to a layered operating system. A bottom layer will be discussed and so will the adequacy of the interface it presents. An analysis of the requirements of the correctness proofs will give us an insight into the logical issues at… Expand
The synchronization of independent processes
An algorithm is given which implements a powerful synchronizing primitive under very weak assumptions about the nature of interprocess communication, and a careful informal proof of its correctness is given. Expand
Operating Systems a Large Semaphore Based Operating System
how this distinction can be used to dissect models of computing systems into subsystems which can be (i) evaluated separately and (ii) represented by a few aggre-gative variables whose interactionsExpand
Application of TLRO to refute an incorrect mutual exclusion algorithm
In this paper a Temporal Logic Related to Observation (TLRO)-based modeling of iterative commands in a concurrent process is considered and it is shown that the construct may be described by a set of three state transition rules. Expand
Resource-Oriented Deadlock Analysis
This presentation is based around a logic programming pearl which finds deadlocked computations in a program which solves the dining philosophers problem. Expand
A proof method for cyclic programs
The input-output based concept of correctness traditionally applied to functional programs is replaced by another, based on the concept of eventual behaviour, which reduces the proof complexity and achieves greater readability in cyclic programs. Expand
Functional behavior in data spaces
If the nondeterministic sequential program is derived from a set of interacting parallel processes then the functional behavior of the former can be expressed in terms of two weaker complementary properties of the latter: weak functional behavior and input/output liveness. Expand
Analysis of distributed systems with mCRL2
The mCRL2 data language is a functional language based on higher-order abstract data types that has concrete data types: standard data types and sorts constructed from a number of type formers. Expand
An approach to automating the verification of compact parallel coordination programs. I
A reachability set description (RSD) is introduced, in which all reachable states of a program (exponential function of N) are collapsed into a fixed number of metastates and the transitions between these metastates are then specified. Expand
BTSL* Model Checking with Fairness for Reo
This thesis introduces Full Branching Time Stream Logic (BTSL*), a combination of CTL and Dynamic LTL which offers the ability to reason about states and actions in a Reo circuit. Expand
A semantics for concurrent separation logic
A resource-sensitive logic for partial correctness, based on a recent proposal of O'Hearn, adapting separation logic to the concurrent setting is introduced, using a novel ''local'' interpretation of traces which allows accurate reasoning about ownership. Expand


The Act of Creation
While the study of psychology has offered little in the way of explaining the creative process, Koestler examines the idea that we are at our most creative when rational thought is suspended--forExpand
The sciences of artifical
  • 1969