Specifying fault-tolerance using split precondition logic

Authors:
Awadhesh Kumar Singh;Anup Kumar Bandyopadhyay
Affiliations:
Department of Computer Engineering, National Institute of Technology, Kurukshetra, India;Department of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata, India
Venue:
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Year:
2010

Citing 6
Cited 0

Closure and Convergence: A Foundation of Fault-Tolerant Computing

IEEE Transactions on Software Engineering - Special issue on software reliability
Predicate transformers for reasoning about concurrent computation

Science of Computer Programming
A Discipline of Programming

A Discipline of Programming
Comparing model checking and logical reasoning for real-time systems

Formal Aspects of Computing
Verifying mutual exclusion and liveness properties with split preconditions

Journal of Computer Science and Technology
Ordering of events in two-process concurrent system

ACM SIGSOFT Software Engineering Notes

Quantified Score

Hi-index	0.00

Visualization

Abstract

The focus of the paper is to provide a formal logic, for specifying fault-tolerant systems, using a state and transition based approach. Another goal is to reason, formally, about the possible behaviors of a system consisting of some malicious nodes. The Byzantine agreement protocol serves as an illustration for the notation. The contribution is the development of a style of modeling and reasoning that allows for a straightforward and thorough analysis of faulttolerant systems.