Fair stateless model checking

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2008, Pages 362-371

  Musuvathi, Madanlal ^a   Qadeer, Shaz ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Concurrency; Fairness; Liveness; Model checking; Multithreading; Shared memory programs; Software testing

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; COMPUTER SOFTWARE SELECTION AND EVALUATION; COMPUTERS; CONCURRENCY CONTROL; CONTROL SYSTEMS; DATA STORAGE EQUIPMENT; LINGUISTICS; SCHEDULING; SOFTWARE TESTING; SPACE RESEARCH;

CONCURRENCY; FAIRNESS; LIVENESS; MULTITHREADING; SHARED-MEMORY PROGRAMS;

MODEL CHECKING;

EID: 57349101529     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375581.1375625     Document Type: Conference Paper

References (28)

1. S. Aggarwal, C. Courcoubetis, and P. Wolper. Adding liveness properties to coupled finite-state machines. ACM Transactions on Programming Languages and Systems. 12(2):303-339. 1990.
2. K.R. Apt and E.-R. Olderog. Proof rules and transformations dealing with fairness. Science of Computer Programming, 3:65-100, 1983.
3. Krzysztof R. Apt, Nissim Francez, and Shmuel Katz. Appraising fairness in languages for distributed programming. In POPL 87: Principles of Programming Languages, pages 189-198, 1987.
4. Satish Chandra, Patrice Godefroid, and Christopher Palm. Software model checking in practice: an industrial case study. In ICSE 02: International Conference on Software Engineering, pages 431-441, 2002.
5. E.M. Clarke and E.A. Emerson. Synthesis of synchronization skeletons for branching time temporal logic. In Logic of Programs, LNCS 131, pages 52-71. Springer-Verlag, 1981.
6. Nissim Francez. Fairness. In Texts and Monographs in Computer Science. Springer-Verlag, 1986.
7. Matteo Frigo, Charles E. Leiserson, and Keith H. Randall. The implementation of the Cilk-5 multithreaded language. In PLDI 98: Programming Language Design and Implementation, pages 212-223. ACM Press, 1998.
8. P. Godefroid. Model checking for programming languages using Verisoft. In POPL 97: Principles of Programming Languages, pages 174-186. ACM Press, 1997.
9. Patrice Godefroid. Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem. LNCS 1032. Springer-Verlag, 1996.
10. Orna Grumberg, Nissim Francez, and Shmuel Katz. Fair termination of communicating processes. In PODC 84: Principles of Distributed Computing, pages 254-265. ACM Press, 1984.
11. Joseph L. Hellerstein. Achieving service rate objectives with decay usage scheduling. IEEE Transactions on Software Engineering, 19(8):813-825, 1993.
12. G. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, May 1997.
13. Galen C. Hunt, Mark Aiken, Manuel Fhndrich, Chris Hawblitze-land Orion Hodson, James R. Lams, Steven Levi, Bjarne Steensgaard, David Tarditi, and Ted Wobber. Sealing OS processes to improve dependability and safety. In Proceedings of the EuroSys Conference, pages 341-354, 2007.
14. Radu Iosif. Exploiting heap symmetries in explicit-state model checking of software. In ASE 01: Automated Software Engineering, pages 254-261, 2001.
15. Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrell, and Dennis Fetterly. Dryad: distributed data-parallel programs from sequential building blocks. In Proceedings of the EuroSys Conference, pages 59-72, 2007.
16. J. Kay and P. Lauder. A fair share scheduler. Communications of the ACM, 31(1):44-55, 1988.
17. Charles Edwin Killian, James W. Anderson, Ranjit Jhala, and Amin Vahdat. Life, death, and the critical transition: Finding liveness bugs in systems code. In NSDI 07: Symposium on Networked Systems Design and Implementation, pages 243-256, 2007.
18. M. Z. Kwiatkowska. Survey of fairness notions. Information and Software Technology, 31(7):371-386, 1989.
19. Daniel J. Lehmann, Amir Pnueli, and Jonathan Stavi. Impartiality, justice and fairness: The ethics of concurrent termination. In ICALP 81: International Conference on Automata Languages and Programming, pages 264-277, 1981.
20. Daan Leijen. Futures: a concurrency library for C#. Technical Report MSR-TR-2006-162, Microsoft Research, 2006.
21. M. Musuvathi, D. Park, A. Chou, D. Engler, and D. L. Dill. CMC: A pragmatic approach to model checking real code. In OSDI 02: Operating Systems Design and Implementation, pages 75-88, 2002.
22. Madanlal Musuvathi and Shaz Qadeer. Iterative context bounding for systematic testing of multithreaded programs. In PLDI 07: Programming Language Design and Implementation, pages 446-455, 2007.
23. Amir Pnueli. The temporal logic of programs. In FOCS 77: Foundations of Computer Science, pages 46-57, 1977.
24. J. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Fifth International Symposium on Programming, LNCS 137, pages 337-351. Springer-Verlag, 1981.
25. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In LICS 86: Logic in Computer Science, pages 322-331. IEEE Computer Society Press, 1986.
26. W. Visser, K. Havelund, G. Brat, and S. Park. Model checking programs. In ASE 00: Automated Software Engineering, pages 3-12, 2000.
27. Carl A. Waldspurger and William E. Weihl. Lottery scheduling: Flexible proportional-share resource management. In OSDI 94: Operating Systems Design and Implementation, pages 1-11, 1994.
28. Junfeng Yang, Paul Twohey, Dawson R. Engler, and Madanlal Musuvathi. Using model checking to find serious file system errors. ACM Transactions on Computer Systems, 24(4):393-423, 2006.