Finding linearization violations in lock-free concurrent data structures
Name
870441973-MIT.pdf
Description
Full printable version
Size
1.22 MB
Format
Adobe PDF
Checksum (MD5)
3eb2d77e44a393335b08ace6dee0c17e
Author(s)
Dabdoub, Sebastien Alberto
Advisor(s)
Frans Kaashoek and Nickolai Zeldovich.
Date Issued
2013
Publisher
Massachusetts Institute of Technology
Abstract
Finding bugs in lock-free concurrent programs is hard. This is due in part to the difficulty of reasoning about the correctness of concurrent algorithms and the timing-sensitive nature of concurrent programs. One of the most widely used tools for reasoning about the correctness of concurrent algorithms is the linearization property. This thesis presents a tool for automatic dynamic checking of concurrent programs under the Total-Store-Order (TSO) memory model and a methodology for finding linearization violations automatically with the tool.
Description
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2013.
Cataloged from PDF version of thesis.
Includes bibliographical references (page 31).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
