Operating systems (2nd ed.): design and implementation
Operating systems (2nd ed.): design and implementation
Operating systems (3rd ed.): internals and design principles
Operating systems (3rd ed.): internals and design principles
Model checking
Monitors: an operating system structuring concept
Communications of the ACM
Communications of the ACM
Comments on a problem in concurrent programming control
Communications of the ACM
Distributed Algorithms
Operating Systems: A Modern Perspective
Operating Systems: A Modern Perspective
Operating System Concepts
Experience with processes and monitors in Mesa (Summary)
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Concurrency: State Models And Java Programs
Concurrency: State Models And Java Programs
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Checking a multithreaded algorithm with +CAL
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Teaching Concurrency: Theory in Practice
TFM '09 Proceedings of the 2nd International Conference on Teaching Formal Methods
Developing UPPAAL over 15 years
Software—Practice & Experience
Hi-index | 0.01 |
During the last three years, we have been experimenting with the use of the Uppaal model checker in an introductory course on operating systems for first-year Computer Science students at the Radboud University Nijmegen. The course uses model checkers as a tool to explain, visualize and solve concurrency problems. Our experience is that students enjoy to play with model checkers because it makes concurrency issues tangible. Even though it is hard to measure objectively, we think that model checkers really help students to obtain a deeper insight into concurrency. In this article, we report on our experiences in the classroom, explain how mutual exclusion algorithms, semaphores and monitors can conveniently be modeled in Uppaal, and present some results on properties of small, concurrent patterns.