NDLI: Bounded partial-order reduction

Content Provider	ACM Digital Library
Author	McKinley, Kathryn S. Musuvathi, Madan Coons, Katherine E.
Abstract	Eliminating concurrency errors is increasingly important as systems rely more on parallelism for performance. Exhaustively exploring the state-space of a program's thread interleavings finds concurrency errors and provides coverage guarantees, but suffers from exponential state-space explosion. Two prior approaches alleviate state-space explosion. (1) Dynamic partial-order reduction (DPOR) provides full coverage and explores only one interleaving of independent transitions. (2) Bounded search provides bounded coverage by enumerating interleavings that do not exceed a bound. In particular, we focus on preemption-bounding. Combining partial-order reduction with preemption-bounding had remained an open problem. We show that preemption-bounded search explores the same partial orders repeatedly and consequently explores more executions than unbounded DPOR, even for small bounds. We further show that if DPOR simply uses the preemption bound to prune the state space as it explores new partial orders, it misses parts of the state space reachable in the bound and is therefore unsound. The bound essentially induces dependences between otherwise independent transitions in the DPOR state space. We introduce Bounded Partial Order Reduction (BPOR), a modification of DPOR that compensates for bound dependences. We identify properties that determine how well bounds combine with partial-order reduction. We prove sound coverage and empirically evaluate BPOR with preemption and fairness bounds. We show that by eliminating redundancies, BPOR significantly reduces testing time compared to bounded search. BPOR's faster incremental guarantees will help testers verify larger concurrent programs.
Starting Page	833
Ending Page	848
Page Count	16
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/2544173.2509556
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	48
Issue Number	10
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1983-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Software testing Concurrency Liveness Model checking Dynamic partial-order reduction Shared-memory programs Fairness
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Bounded partial-order reduction

Fair stateless model checking

Iterative context bounding for systematic testing of multithreaded programs

Optimal dynamic partial order reduction

Dynamic partial-order reduction for model checking software

GAMBIT:effective unit testing for concurrency libraries

Fair stateless model checking

Dynamic partial order reduction for relaxed memory models

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

Bounded partial-order reduction

Similar Documents

Bounded partial-order reduction

Fair stateless model checking

Iterative context bounding for systematic testing of multithreaded programs

Optimal dynamic partial order reduction

Dynamic partial-order reduction for model checking software

GAMBIT:effective unit testing for concurrency libraries

Fair stateless model checking

Dynamic partial order reduction for relaxed memory models

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

Bounded partial-order reduction