Mechanical verification of Lamport’s Bakery algorithm

Proof assistants like PVS can be used fruitfully for the design and verification of concurrent algorithms. The technique is presented here by applying it to Lamport’s Bakery algorithm. The proofs for safety properties such as mutual exclusion, first-come–first-served, and absence of deadlock are bas...

Full description

Bibliographic Details

Published in:	Science of computer programming Vol. 78; no. 9; pp. 1622 - 1638
Main Author:	Hesselink, Wim H.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.09.2013
Subjects:	FCFS Mechanical theorem proving Mutual exclusion Safe variables Shared variables FCFS Mutual exclusion Shared variables Mechanical theorem proving Safe variables
ISSN:	0167-6423, 1872-7964
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!