Finding linearization violations in lock-free concurrent data structures
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2013.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/85413 |
| _version_ | 1826203830607413248 |
|---|---|
| author | Dabdoub, Sebastien Alberto |
| author2 | Frans Kaashoek and Nickolai Zeldovich. |
| author_facet | Frans Kaashoek and Nickolai Zeldovich. Dabdoub, Sebastien Alberto |
| author_sort | Dabdoub, Sebastien Alberto |
| collection | MIT |
| description | Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2013. |
| first_indexed | 2024-09-23T12:43:53Z |
| format | Thesis |
| id | mit-1721.1/85413 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T12:43:53Z |
| publishDate | 2014 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/854132019-04-11T11:22:21Z Finding linearization violations in lock-free concurrent data structures Dabdoub, Sebastien Alberto Frans Kaashoek and Nickolai Zeldovich. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. 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). 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. by Sebastien Alberto Dabdoub. M. Eng. 2014-03-06T15:40:16Z 2014-03-06T15:40:16Z 2013 2013 Thesis http://hdl.handle.net/1721.1/85413 870441973 eng 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. http://dspace.mit.edu/handle/1721.1/7582 31 pages application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Dabdoub, Sebastien Alberto Finding linearization violations in lock-free concurrent data structures |
| title | Finding linearization violations in lock-free concurrent data structures |
| title_full | Finding linearization violations in lock-free concurrent data structures |
| title_fullStr | Finding linearization violations in lock-free concurrent data structures |
| title_full_unstemmed | Finding linearization violations in lock-free concurrent data structures |
| title_short | Finding linearization violations in lock-free concurrent data structures |
| title_sort | finding linearization violations in lock free concurrent data structures |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/85413 |
| work_keys_str_mv | AT dabdoubsebastienalberto findinglinearizationviolationsinlockfreeconcurrentdatastructures |