Mechanical verification of automatic synthesis of fault-tolerant programs

Authors:
Sandeep S. Kulkarni;Borzoo Bonakdarpour;Ali Ebnenasir
Affiliations:
Department of Computer Science and Engineering, Michigan State University, East Lansing, Michigan;Department of Computer Science and Engineering, Michigan State University, East Lansing, Michigan;Department of Computer Science and Engineering, Michigan State University, East Lansing, Michigan
Venue:
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Year:
2004

Citing 12
Cited 0

Closure and Convergence: A Foundation of Fault-Tolerant Computing

IEEE Transactions on Software Engineering - Special issue on software reliability
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS

IEEE Transactions on Software Engineering
Synthesis of concurrent systems with many similar processes

ACM Transactions on Programming Languages and Systems (TOPLAS)
Synthesis of Communicating Processes from Temporal Logic Specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Automating the Addition of Fault-Tolerance

FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Verifying a self-stabilizing mutual exclusion algorithm

PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
A case-study in component-based mechanical verification of fault-tolerant programs

ICDCS '99 Workshop on Self-stabilizing Systems
Enhancing The Fault-Tolerance of Nonmasking Programs

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Synthesizing Distributed Systems

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Component based design of fault-tolerance

Component based design of fault-tolerance
Automated Synthesis of Multitolerance

DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fault-tolerance is a crucial property in many systems. Thus, mechanical verification of algorithms associated with synthesis of faulttolerant programs is desirable to ensure their correctness. In this paper, we present the mechanized verification of algorithms that automate the addition of fault-tolerance to a given fault-intolerant program using the PVS theorem prover. By this verification, not only we prove the correctness of the synthesis algorithms, but also we guarantee that any program synthesized by these algorithms is correct by construction. Towards this end, we formally define a uniform framework for formal specification and verification of fault-tolerance that consists of abstract definitions for programs, specifications, faults, and levels of fault-tolerance, so that they are independent of platform and architecture. The essence of synthesis algorithms involves fixpoint calculations. Hence, we also develop a reusable library for fixpoint calculations on finite sets in PVS.