CHESS: Systematic stress testing of concurrent software

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4407 LNCS, Issue , 2007, Pages 15-16

  Musuvathi, Madan ^a   Qadeer, Shaz ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34548061237     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-71410-1_2     Document Type: Conference Paper

References (6)

1. Tayfun Elmas, Shaz Qadeer, and Serdar Tasiran. Goldilocks: Efficiently computing the happens-before relation using locksets, 2006. Full version available at http://www.research.microsoft.com/~qadeer/fatesrv06-fullversion.ps.
2. C. Flanagan and P. Godefroid. Dynamic partial-order reduction for model checking software. In POPL 05: Principles of Programming Languages, pages 110-121. ACM Press, 2005.
3. Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-565, 1978.
4. Friedemann Mattern. Virtual time and global states of distributed systems. In International Workshop on Parallel and Distributed Algorithms, pages 215-226. NorthHolland, 1989.
5. S. Qadeer and J. Rehof. Context-bounded model checking of concurrent software. In TACAS 05: Tools and Algorithms for the Construction and Analysis of Systems, volume 3440 of Lecture Notes in Computer Science, pages 93-107. Springer, 2005.
6. S. Qadeer and D. Wu. KISS: Keep it simple and seqeuential. In PLDI 04: Programming Language Design and Implementation, pages 14-24. ACM, 2004.