On the correctness issues in two-process mutual exclusion algorithms

Authors:
Jayasri Banerjee;Anup Kumar Bandyopadhyay;Ajit Kumar Mandal
Affiliations:
Jadavpur University, Kolkata, India;Jadavpur University, Kolkata, India;Jadavpur University, Kolkata, India
Venue:
ACM SIGSOFT Software Engineering Notes
Year:
2007

Citing 4
Cited 4

On the derivation of a correct deadlock free communication kernel for loop connected message passing architecture from its user's specification

Journal of Systems Architecture: the EUROMICRO Journal
Comments on a problem in concurrent programming control

Communications of the ACM
A Discipline of Programming

A Discipline of Programming
Ordering of events in two-process concurrent system

ACM SIGSOFT Software Engineering Notes

Modeling fairness and starvation in concurrent systems

ACM SIGSOFT Software Engineering Notes
Fairness and conspiracy concepts in concurrent systems

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
Application of TLRO to refute an incorrect mutual exclusion algorithm

ACM SIGSOFT Software Engineering Notes

Quantified Score

Hi-index	0.00

Visualization

Abstract

Correctness issues in two process mutual exclusion algorithms are investigated. A new theorem is proposed and proved that describes the key concept involved in such algorithms. For the purpose of proving the techniques developed in [3] are used. Result of this theorem is applied to two different algorithms of which one could be proved incorrect. Technique developed in [3] is also used to prove the correct algorithm.