Verifying mutual exclusion and liveness properties with split preconditions

Authors:
Awadhesh Kumar Singh;Anup Kumar Bandyopadhyay
Affiliations:
Department of Computer Engineering, National Institute of Technology, Kurukshetra 136119, India;Dcpartment of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata 700032, India
Venue:
Journal of Computer Science and Technology
Year:
2004

Citing 28
Cited 3

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Communicating sequential processes

Communicating sequential processes
Actors: a model of concurrent computation in distributed systems

Actors: a model of concurrent computation in distributed systems
The weakest prespecification

Information Processing Letters
Understanding Z: a specification language and its formal semantics

Understanding Z: a specification language and its formal semantics
Verifying temporal properties without temporal logic

ACM Transactions on Programming Languages and Systems (TOPLAS)
A generalization of Dijkstra's calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
Where can I get gas round here? An application of a design methodology for distributed systems

Algebraic methods II
Mathematical logic for computer science

Mathematical logic for computer science
An introduction to assertional reasoning for concurrent systems

ACM Computing Surveys (CSUR)
The temporal logic of actions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Predicate transformers for reasoning about concurrent computation

Science of Computer Programming
Temporal verification of reactive systems: safety

Temporal verification of reactive systems: safety
Mathematical Notation in Formal Specification: Too Difficult for the Masses?

IEEE Transactions on Software Engineering
Event-based detection of concurrency

SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
A Proof System for Communicating Sequential Processes

ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying Concurrent Program Modules

ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying properties of parallel programs: an axiomatic approach

Communications of the ACM
Dynamically Discovering Likely Program Invariants to Support Program Evolution

IEEE Transactions on Software Engineering - Special issue on 1999 international conference on software engineering
Mining specifications

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Distributed Algorithms

Distributed Algorithms
A Calculus of Communicating Systems

A Calculus of Communicating Systems
Automata, Languages, and Machines

Automata, Languages, and Machines
A Discipline of Programming

A Discipline of Programming
Tracking down software bugs using automatic anomaly detection

Proceedings of the 24th International Conference on Software Engineering
Semantic anomaly detection in online data sources

Proceedings of the 24th International Conference on Software Engineering
Hennessy-Milner Logic with Recursion as a Specification Language, and a Refinement Calculus based on It

Proceedings of the BCS-FACS Workshop on Specification and Verification of Concurrent Systems
Automatic verification for a class of distributed systems

Distributed Computing

Ordering of events in two-process concurrent system

ACM SIGSOFT Software Engineering Notes
Weakest precondition based modelling and verification of a class of concurrent systems

International Journal of Artificial Intelligence and Soft Computing
Specifying fault-tolerance using split precondition logic

ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work is focused on presenting a split precondition approach for the modeling and proving the correctness of distributed algorithms. Formal specification and precise analysis of Peterson's distributed mutual exclusion algorithm for two process has been considered. The proof of properties like, mutual exclusion, liveness, and lockout-freedom have also been presented.