• Publications
  • Influence
Programming from specifications
  • C. Morgan
  • Computer Science
  • Prentice Hall International Series in computer…
  • 1 May 1990
This revised edition covers topics such as procedures, parameters, recursion and data refinement, with the integration of specification, development and coding, based on ordinary (classical) logic. Expand
  • 1,342
  • 105
Abstraction, Refinement and Proof for Probabilistic Systems
Probabilistic guarded commands and their refinement logic.- to pGCL: Its logic and its model. Expand
  • 356
  • 50
  • PDF
Programming from specifications (2nd ed.)
  • 457
  • 29
Probabilistic predicate transformers
Probabilistic predicates generalize standard predicates over a state space; with Probabilistic predicate transformers one thus reasons about imperative programs in terms of probabilistic pre- and postconditions. Expand
  • 315
  • 18
  • PDF
Laws of programming
A complete set of algebraic laws is given for Dijkstra's nondeterministic sequential programming language. Expand
  • 413
  • 10
  • PDF
The specification statement
Dijkstra's language is extended by <italic>specification statements</italic>, which specify parts of a program “yet to be developed.” A weakest precondition semantics is given for these statements so that the extended language has a meaning as precise as the original. Expand
  • 310
  • 10
  • PDF
Partial correctness for probabilistic demonic programs
We provide an operational and axiomatic framework for both partial and total correctness of probabilistic and demonic sequential programs; among other things, that provides the theory to support our earlier---and practical---publication on demonic nondeterminism. Expand
  • 52
  • 10
  • PDF
Of wp and CSP
A state-based and an event-based approach to concurrency are linked: the traces, failures and divergences of CSP are expressed as weakest precondition formulae over Action Systems. Expand
  • 95
  • 9
Results on the quantitative μ-calculus qMμ
The μ-calculus is a powerful tool for specifying and verifying transition systems, including those with both demonic (universal) and angelic (existential) choice; its quantitative generalization qMμ extends to include probabilistic choice. Expand
  • 57
  • 8
Refinement of State-Based Concurrent Systems
The traces, failures, and divergences of CSP can be expressed as weakest precondition formulae over action systems, by giving two proof methods which are sound and jointly complete: forwards and backwards simulations. Expand
  • 116
  • 7