Publication Type |
Journal Article |
School or College |
College of Engineering |
Department |
Computing, School of |
Creator |
Regehr, John |
Other Author |
Reid, Alastair |
Title |
Lock inference for systems software |
Date |
2003-01-01 |
Description |
We have developed task scheduler logic (TSL) to automate reasoning about scheduling and concurrency in systems software. TSL can detect race conditions and other errors as well as supporting lock inference: the derivation of an appropriate lock implementation for each critical section in a system. Lock inference solves a number of problems in creating flexible, reliable, and efficient systems software. TSL is based on a notion of asymmetrical preemption relations and it exploits the hierarchical inheritance of scheduling properties that is common in systems software. |
Type |
Text |
Publisher |
University of Utah |
Dissertation Institution |
University of Utah |
Language |
eng |
Bibliographic Citation |
Regehr, J., & Reid, A. (2003). Lock inference for systems software. In Proceedings of the Second AOSD Workshop on Aspects, Components, and Patterns for Infrastructure Software (ACP4IS). March 17. |
Rights Management |
(c)University of Utah |
Format Medium |
application/pdf |
Format Extent |
99,657 bytes |
Identifier |
uspace,17502 |
ARK |
ark:/87278/s6ht373t |
Setname |
ir_uspace |
ID |
708002 |
Reference URL |
https://collections.lib.utah.edu/ark:/87278/s6ht373t |