An important aspect which is often overlooked in software design of distributed environments is that of fault tolerance. Many methodologies in the past have attempted to provide fault tolerance efficiently but have never been successful at eliminating explicit time and space redundancy. One approach for providing fault tolerance is through examining the behavior and properties of the application and deriving executable assertions that detect faults. Our work focuses on transforming the assertions of a verification proof of a program to executable assertions. These executable assertions may be embedded in the program to create a fault-tolerant program. It is also shown how the natural redundancy of the program variables can be used to reduce the number of executable assertions needed. While this approach has been applied to the sequential programming environment, the distributed programming environment presents special challenges, litis paper focuses on applying concurrent programming axiomatic proof systems to generate executable assertions in a distributed environment using distributed branch and bound as a model problem.
H. Lutfiyya et al., "Fault-tolerant Concurrent Branch And Bound Algorithms Derived From Program Verification," Proceedings - International Computer Software and Applications Conference, pp. 182 - 187, article no. 217571, Institute of Electrical and Electronics Engineers, Jan 1992.
The definitive version is available at https://doi.org/10.1109/CMPSAC.1992.217571
International Standard Serial Number (ISSN)
Article - Conference proceedings
© 2023 Institute of Electrical and Electronics Engineers, All rights reserved.
01 Jan 1992