skip to main content
abstract

The lazy happens-before relation: better partial-order reduction for systematic concurrency testing

Published:24 January 2015Publication History
Skip Abstract Section

Abstract

We present the lazy happens-before relation (lazy HBR), which ignores mutex-induced edges to provide a more precise notion of state equivalence compared with the traditional happens-before relation. We demonstrate experimentally that the lazy HBR has the potential to provide greater schedule reduction during systematic concurrency testing with respect to a set of 79 Java benchmarks.

References

  1. C. Flanagan and P. Godefroid. Dynamic partial-order reduction for model checking software. In POPL, pages 110–121, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems. Springer, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. P. Godefroid. Model checking for programming languages using VeriSoft. In POPL, pages 174–186, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. Musuvathi and S. Qadeer. Partial-order reduction for contextbounded state exploration. Technical Report MSR-TR-2007-12, Microsoft Research, 2007.Google ScholarGoogle Scholar
  5. M. Musuvathi et al. Finding and reproducing Heisenbugs in concurrent programs. In OSDI, pages 267–280, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Introduction Example Evaluation Future Work: Lazy DPORGoogle ScholarGoogle Scholar

Index Terms

  1. The lazy happens-before relation: better partial-order reduction for systematic concurrency testing

              Recommendations

              Comments

              Login options

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

              Sign in

              Full Access

              • Published in

                cover image ACM SIGPLAN Notices
                ACM SIGPLAN Notices  Volume 50, Issue 8
                PPoPP '15
                August 2015
                290 pages
                ISSN:0362-1340
                EISSN:1558-1160
                DOI:10.1145/2858788
                • Editor:
                • Andy Gill
                Issue’s Table of Contents
                • cover image ACM Conferences
                  PPoPP 2015: Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
                  January 2015
                  290 pages
                  ISBN:9781450332057
                  DOI:10.1145/2688500

                Copyright © 2015 Owner/Author

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 24 January 2015

                Check for updates

                Qualifiers

                • abstract

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader
              About Cookies On This Site

              We use cookies to ensure that we give you the best experience on our website.

              Learn more

              Got it!