This is the home page of the lock-free program verification group. Its current members are (in no particular order)
Publications
R. Colvin and B.Dongol. A General Technique for Proving Lock-Freedom. Science of Computer Programming Journal (in press). 2008 [PVS files]
R. Colvin and B. Dongol. Verifying Lock-Freedom using Well-Founded Orders. International Colloquium on Theoretical Aspects of Computing. Lecture Notes in Computer Science, volume 4711, 2007, pages 124-138. [PVS files]
B. Dongol. Towards simpler proofs of lock-freedom. Preliminary Proceedings of the 1st Asian Working Conference on Verified Software, 2006, pages 136-146.
B. Dongol. Formalising progress properties of non-blocking algorithms . In Z. Liu and J. He, editors, Proceedings of the 8th International Conference on Formal Engineering Methods, Lecture Notes in Computer Science, volume 4260, 2006, pages 284-303.