Advertisement

Recovery Blocks

  • Tony Hoare
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6875)

Abstract

We give a semantics for Brian Randell’s recovery blocks, and show how they can be proved correct. The formalisation is expressed wholly in propositional logic.

Keywords

Propositional Calculus Successful Execution Programming Error Program Text Weak Precondition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Dijkstra76]
    Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)zbMATHGoogle Scholar
  2. [Hoare69]
    Hoare, C.A.R.: An Axiomatic Basis for Computer Programming. Communications of the ACM 12(10), 576–580, 583 (1969)CrossRefzbMATHGoogle Scholar
  3. [HoHe98]
    Hoare, C.A.R.: He Jifeng: Unifying Theories of Programming. Prentice-Hall, Englewood Cliffs (1998)Google Scholar
  4. [Randell75]
    Randell, B.: System Structure for Fault Tolerance. IEEE Transactions on Software Engineering SE-1, 220–232 (1975)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Tony Hoare
    • 1
  1. 1.Microsoft ResearchCambridgeUK

Personalised recommendations