A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Locking discipline inference and checking
2016
Proceedings of the 38th International Conference on Software Engineering - ICSE '16
Concurrency is a requirement for much modern software, but the implementation of multithreaded algorithms comes at the risk of errors such as data races. Programmers can prevent data races by documenting and obeying a locking discipline, which indicates which locks must be held in order to access which data. This paper introduces a formal semantics for locking specifications that gives a guarantee of race freedom. A notable difference from most other semantics is that it is in terms of values
doi:10.1145/2884781.2884882
dblp:conf/icse/ErnstLMST16
fatcat:zyxcwtoepvdbnhppnrgjss4b7q