Weakest Invariant Generation for Automated Addition of Fault-Tolerance

Authors:
Fuad Abujarad;Sandeep S. Kulkarni
Affiliations:
Department of Computer Science and Engineering, Michigan State University, East Lansing, USA;Department of Computer Science and Engineering, Michigan State University, East Lansing, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 15
Cited 1

A tree-based algorithm for distributed mutual exclusion

ACM Transactions on Computer Systems (TOCS)
Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Symbolic model checking for real-time systems

Information and Computation
Automatic generation of invariants and intermediate assertions

Theoretical Computer Science - Special issue: principles and practice of constraint programming
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Symbolic Model Checking

Symbolic Model Checking
Automatic generation of program specifications

ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Powerful Techniques for the Automatic Generation of Invariants

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Designing masking fault-tolerance via nonmasking fault-tolerance

SRDS '95 Proceedings of the 14TH Symposium on Reliable Distributed Systems
An Algorithm for Strengthening State Invariants Generated from Requirements Specifications

RE '01 Proceedings of the Fifth IEEE International Symposium on Requirements Engineering
Complexity Issues in Automated Synthesis of Failsafe Fault-Tolerance

IEEE Transactions on Dependable and Secure Computing
Weakest-precondition of unstructured programs

PASTE '05 Proceedings of the 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space

ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Efficient weakest preconditions

Information Processing Letters

Complexity issues in automated model revision without explicit legitimate state

SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the important tasks in evolving a fault-intolerant program into a fault-tolerant one is to identify the legitimate states (its invariant) from where the original program satisfies its specification. This allows us to ensure that the fault-tolerant program recovers to these legitimate states from where it satisfies its specification. It is desired that the invariant be the weakest possible so as to provide maximal options to the algorithm for adding fault-tolerance. Requiring the designer to specify such weak invariant increases the burden on the designer. In this paper, we present a novel approach for automating the generation of the weakest invariant from the program actions and specifications. Our algorithm is efficient and manages the state explosion problem with the use of BDDs. We demonstrate our approach through two case studies and we show that generating such invariants is extremely fast. For example, for a mutual exclusion program with a state space of size 10^8^4 states, it took 0.9 of a second.