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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)
Hoare, C.A.R.: An Axiomatic Basis for Computer Programming. Communications of the ACM 12(10), 576–580, 583 (1969)
Hoare, C.A.R.: He Jifeng: Unifying Theories of Programming. Prentice-Hall, Englewood Cliffs (1998)
Randell, B.: System Structure for Fault Tolerance. IEEE Transactions on Software Engineering SE-1, 220–232 (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hoare, T. (2011). Recovery Blocks. In: Jones, C.B., Lloyd, J.L. (eds) Dependable and Historic Computing. Lecture Notes in Computer Science, vol 6875. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24541-1_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-24541-1_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24540-4
Online ISBN: 978-3-642-24541-1
eBook Packages: Computer ScienceComputer Science (R0)