×
Liu, Zhiming; Joseph, Mathai

Transformation of programs for fault-tolerance. (English) Zbl 0754.68084

Formal Asp. Comput. 4, No. 5, 442-469 (1992).

Cited in 6 Documents

MSC:

68Q60 Specification and verification (program logics, model checking, etc.)
68N99 Theory of software

Keywords:

failure semantics; consistency; fault-tolerant transformation; fault- tolerant refinement

Software:

UNITY
Cite Review PDF
Full Text: DOI

References:

[1] Abadi, M. and Lamport, L.: The Existence of Refinement Mapping. In:Proc. 3rd IEEE Symp. on Logic and Computer Science, 1988.
[2] Anderson, T. and Lee, P. A.:Fault-tolerance: Principles and Practice. Prentice-Hall International, 1981. · Zbl 0697.68010
[3] Back, R. J. R.: A Calculus of Refinement for Program Derivations. Technical Report 54, Abo Akademi, 1987.
[4] Back, R. J. R.: Refining Atomicity in Parallel Algorithms. Technical Report 57, Abo Akademi, 1988.
[5] Back, R. J. R.: Refinement Calculus, Part II: Parallel and Reactive Programs. In:Lecture Notes in Computer Science 340, pp. 67-93. Springer-Verlag, 1989.
[6] Back, R. J. R. and Kurki-Suonio, R.: Decentralization of Process Nets with Centralized Control. In:Second Annual ACM Symp. on Principles of Distributed Computing, pp. 131-142, 1983.
[7] Back, R. J. R. and Sere, K.: Stepwise Refinement of Parallel Algorithms. Technical Report 64, Abo Akademi, 1988. · Zbl 0705.68057
[8] Back, R. J. R. and Sere, K.: Stepwise Refinement of Action Systems. Technical Report 78, Abo Akademi, 1989. · Zbl 0705.68057
[9] Back, R. J. R. and Wright, J. von: Refinement Calculus, Part I: Sequential Nondeterministic Programs. In:Lecture Notes in Computer Science 340, pp. 42-66. Springer-Verlag, 1989.
[10] Best, E. and Randell, B.: A Formal Model of Atomicity in Asynchronous Systems.Acta Informatica,16, 93-124 (1981). · Zbl 0511.68033 · doi:10.1007/BF00289593
[11] Chandy, K. M. and Misra, J.:Parallel Program Design: A Foundation. Addison-Wesley Publishing Company, 1988. · Zbl 0717.68034
[12] Cristian, F.: A Rigorous Approach to Fault Tolerant Programming.IEEE Transactions on Software Engineering,SE-11(1), 23-31 (1985). · doi:10.1109/TSE.1985.231534
[13] Dijkstra, E. W.:A Discipline of Programming. Prentice-Hall, Englewood Cliffs, NJ, 1976. · Zbl 0368.68005
[14] Francez, N.:Fairness. Springer-Verlag, New York, 1986.
[15] Gerth, R. and Pnueli, A.: Rooting UNITY. In:Proc. 5th IEEE International Workshop on Software Specification and Design, February 1989.
[16] He, J. and Hoare, C. A. R.: Algebraic Specification and Proof of a Distributed Recovery Algorithm.Distributed Computing,2, 1-12 (1987). · Zbl 0621.68008 · doi:10.1007/BF01786251
[17] Herlihy, M. P. and Wing, J. M.: Reasoning About Atomic Objects. In:Lecture Notes in Computer Science 331, pp. 193-208, Springer-Verlag, 1988.
[18] Hoare, C. A. R.: An Axiomatic Basis for Computer Programming.Communications of the ACM,12(10), 576-583 (1969). · Zbl 0179.23105 · doi:10.1145/363235.363259
[19] Joseph, M. and Goswami, A.: What’s ?Real? About Real-Time Systems? In:Proc. of IEEE Real-time Systems Symp., pp. 78-85, Huntsville, Alabama, December 1988.
[20] Joseph, M., Moitra, A. and Soundararajan, N.: Proof Rules for Fault Tolerant Distributed Programs.Science of Computer Programming,8(1), 43-67 (1987). · Zbl 0608.68016 · doi:10.1016/0167-6423(87)90003-7
[21] Koo, R. and Toueg, S.: Checkpointing and Rollback-Recovery for Distributed Systems.IEEE Transactions on Software Engineering,SE-13(1), 23-31 (1987). · Zbl 0603.68018 · doi:10.1109/TSE.1987.232562
[22] Lamport, L.: Reasoning about Nonatomic Operations. In:Proc. 10th ACM Conf. on Principles of Programming Languages, pp. 28-37, 1983.
[23] Lamport, L.:win andsin: Predicate Transformers for Concurrency. Technical Report 17, Systems Research Center of Digital Equipment Corporation in Palo Alto, California, May 1987.
[24] Lamport, L.: A Temporal Logic of Actions. Technical report, Digital SRC, California, April 1990. · Zbl 0699.68044
[25] Lamport, L.: The Temporal Logic of Actions. Digital SRC, California, January 1991.
[26] Liu, Z.: Fault-Tolerant Programming By Transformations. PhD Thesis, Department of Computer Science, University of Warwick, July 1991.
[27] Morgan, C:Programming from Specification. Prentice Hall, 1990.
[28] Manna, Z. and Pnueli, A.: How to Cook a Temporal Proof System for Your Pet Language. In:Proc. 10th Ann. ACM Symp. on Principles of Programming Languages, Austin, Texas, 1983. · Zbl 0507.68005
[29] Merlin, P. M. and Randell, B.: State Restoration in Distributed Systems. In:Proc. of 8th Ann. Int. Symp. on Fault-Tolerant Computing., pp. 129-134, Toulouse, France, 1978.
[30] Randell, B.: System Structure for Software Fault Tolerance.IEEE Transactions on Software Engineering,SE-1(2), 220-232 (1975).
[31] Schlichting, R. D. and Schneider, F. B.: Fail-Stop Processes: An Approach to Designing Fault-Tolerant Computing Systems.ACM Transactions on Computer Systems,1(3), 222-238 (1983). · doi:10.1145/357369.357371
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.