The Lazy Happens-Before Relation: Better Partial-Order Reduction for Systematic Concurrency Testing
File(s)PPoPP.pdf (524.62 KB)
Accepted version
Author(s)
Thomson, P
Donaldson, AF
Type
Conference Paper
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.
Date Issued
2015-01-24
Date Acceptance
2015-01-01
Citation
ACM Sigplan Notices, 2015, 50 (8), pp.259-260
ISBN
978-1-4503-3205-7
ISSN
1523-2867
Publisher
Association for Computing Machinery (ACM)
Start Page
259
End Page
260
Journal / Book Title
ACM Sigplan Notices
Volume
50
Issue
8
Copyright Statement
© ACM, 2015. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Sigplan Notices, {VOL# 50, ISS# 8, (24 Jan 2015)} https://dx.doi.org/10.1145/2688500.2688533
Source
PPoPP 2015 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Subjects
Science & Technology
Technology
Computer Science, Software Engineering
Computer Science
Partial-order reduction
systematic concurrency testing
Publication Status
Published
Start Date
2015-02-07
Finish Date
2015-02-11
Coverage Spatial
San Francisco, CA, USA