research-article

Using model checkers in an introductory course on operating systems

Authors:

Roelof Hamberg,

Frits VaandragerAuthors Info & Claims

ACM SIGOPS Operating Systems Review, Volume 42, Issue 6

Pages 101 - 111

https://doi.org/10.1145/1453775.1453793

Published: 01 October 2008 Publication History

Abstract

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.

References

[1]

G. Behrmann, A. David, and K. Larsen. A tutorial on Uppaal. In Formal Methods for the Design of Real-Time Systems, LNCS 3185, pages 200--236. Springer, 2004.

[2]

G. Behrmann, A. David, K. G. Larsen, J. Håkansson, P. Pettersson, W. Yi, and M. Hendriks. Uppaal 4.0. In Proceedings QEST, pages 125--126. IEEE CS, 2006.

Digital Library

[3]

N. Bogunovic and E. Pek. Verification of mutual exclusion algorithms with SMV system. In EUROCON 2003. Computer as a Tool. The IEEE Region 8. Vol 2, pages 21--25. IEEE CS, 2003.

[4]

E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, Cambridge, MA, 1999.

Digital Library

[5]

E. W. Dijkstra. Cooperating sequential processes. In Programming Languages. Academic Press, 1968.

[6]

E. W. Dijkstra. Hierarchical ordering of sequential processes. Acta Informatica, 1:115--138, 1971.

Digital Library

[7]

E. W. Dijkstra. The humble programmer. Commun. ACM, 15(10):859--866, 1972. Turing Award lecture.

Digital Library

[8]

A. Downey. The Little Book of Semaphores. Green Tea Press, second edition, 2005.

[9]

A. Downey. The Little Book of Semaphores. Green Tea Press, 2.1.2 edition, 2007.

[10]

C. Hoare. Monitors: An operating system structuring concept. Commun. ACM, 17(10):549--557, 1974.

Digital Library

[11]

G. Holzmann. The SPIN Model Checker: Primer and Reference Manual. Addison Wesley, 2004.

Digital Library

[12]

H. Hyman. Comments on a problem in concurrent programming control. Commun. ACM, 9(1):45, 1966.

Digital Library

[13]

L. Lamport. Checking a multithreaded algorithm with +cal. In Proceedings DISC 2006, LNCS 4167, pages 151--163. Springer, 2006.

Digital Library

[14]

B. W. Lampson and D. D. Redell. Experience with processes and monitors in mesa. In Proceedings SOSP, pages 43--44, 1979.

Digital Library

[15]

N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, San Fransisco, CA, 1996.

Digital Library

[16]

J. Magee and J. Kramer. Concurrency: State Models and Java Programs. John Wiley, 2006.

Digital Library

[17]

G. Nutt. Operating Systems: A Modern Perspective. Addison Wesley Longman, 2nd ed, 2000.

Digital Library

[18]

G. Peterson. Myths about the mutual exclusion problem. Inf. Process. Lett., 12(3):115--116, 1981.

[19]

A. Silberschatz and P. Galvin. Operating System Concepts. Addison Wesley Longman, 5th ed, 1997.

Digital Library

[20]

W. Stallings. Operating Systems: Internals and Design Principles. Prentice-Hall, 5th ed, 2005.

Digital Library

[21]

H. Sutter. The free lunch is over -- a fundamental turn toward concurrency in software. Dr. Dobb's Journal, 30(3), 2005.

[22]

A. Tanenbaum and A. Woodhull. Operating Systems: Design and Implementation. Prentice-Hall, 2nd ed, 1997.

Digital Library

Cited By

Evrard HDonaldson A(2023)Model Checking FutexesModel Checking Software10.1007/978-3-031-32157-3_3(41-58)Online publication date: 26-Apr-2023
https://dl.acm.org/doi/10.1007/978-3-031-32157-3_3
Aceto LIngólfsdóttir A(2021)Introducing Formal Methods to First-Year Students in Three Intensive WeeksFormal Methods Teaching10.1007/978-3-030-91550-6_1(1-17)Online publication date: 21-Nov-2021
https://dl.acm.org/doi/10.1007/978-3-030-91550-6_1
Arbab FJongmans S(2015)Coordinating Multicore ComputingFormal Methods for Multicore Programming10.1007/978-3-319-18941-3_2(57-96)Online publication date: 7-May-2015
https://doi.org/10.1007/978-3-319-18941-3_2
Show More Cited By

Index Terms

Recommendations

Comparison of Maude and SAL by Conducting Case Studies Model Checking a Distributed Algorithm

SAL is a toolkit for analyzing transition systems, providing several different tools. Among the tools are a BDD-based symbolic model checker (SMC) and an SMT-based infinite bounded model checker (infBMC). The unique functionality provided by SAL is k -...
Introducing parallelism and concurrency in the data structures course
SIGCSE '12: Proceedings of the 43rd ACM technical symposium on Computer Science Education

We report on our experience integrating a three-week introduction to multithreading in a required data structures course for second-year computer science majors. We emphasize a distinction between parallelism and concurrency that teaches students to use ...
Fair stateless model checking
PLDI '08

Stateless model checking is a useful state-space exploration technique for systematically testing complex real-world software. Existing stateless model checkers are limited to the verification of safety properties on terminating programs. However, ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGOPS Operating Systems Review

ACM SIGOPS Operating Systems Review Volume 42, Issue 6

October 2008

111 pages

ISSN:0163-5980

DOI:10.1145/1453775

Issue’s Table of Contents

Copyright © 2008 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 2008

Published in SIGOPS Volume 42, Issue 6

Check for updates

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
347
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Evrard HDonaldson A(2023)Model Checking FutexesModel Checking Software10.1007/978-3-031-32157-3_3(41-58)Online publication date: 26-Apr-2023
https://dl.acm.org/doi/10.1007/978-3-031-32157-3_3
Aceto LIngólfsdóttir A(2021)Introducing Formal Methods to First-Year Students in Three Intensive WeeksFormal Methods Teaching10.1007/978-3-030-91550-6_1(1-17)Online publication date: 21-Nov-2021
https://dl.acm.org/doi/10.1007/978-3-030-91550-6_1
Arbab FJongmans S(2015)Coordinating Multicore ComputingFormal Methods for Multicore Programming10.1007/978-3-319-18941-3_2(57-96)Online publication date: 7-May-2015
https://doi.org/10.1007/978-3-319-18941-3_2
Behrmann GDavid ALarsen KPettersson PYi W(2011)Developing UPPAAL over 15 yearsSoftware—Practice & Experience10.1002/spe.100641:2(133-142)Online publication date: 1-Feb-2011
https://dl.acm.org/doi/10.1002/spe.1006
Aceto LIngolfsdottir ALarsen KSrba J(2009)Teaching ConcurrencyProceedings of the 2nd International Conference on Teaching Formal Methods10.1007/978-3-642-04912-5_11(158-175)Online publication date: 27-Oct-2009
https://dl.acm.org/doi/10.1007/978-3-642-04912-5_11

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents