On the correctness issues in two-process mutual exclusion algorithms
Jayasri Banerjee, Anup Bandyopadhyay, Ajit Kumar Mandal · ACM SIGSOFT Software Engineering Notes · 2007
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.