Verifying Lock-Freedom Using Well-Founded Orders

DOI10.1007/978-3-540-75292-9_9zbMath1147.68443OpenAlexW2145878518MaRDI QIDQ3525079

Brijesh Dongol, Robert J. Colvin

Publication date: 17 September 2008

Published in: Theoretical Aspects of Computing – ICTAC 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75292-9_9

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

A general technique for proving lock-freedom

Uses Software

• PVS

This page was built for publication: Verifying Lock-Freedom Using Well-Founded Orders