@inproceedings{emmi2011delay-bounded,
author = {Emmi, Michael and Qadeer, Shaz and Rakamaric, Zvonimir},
title = {Delay-bounded scheduling},
booktitle = {Proceedings of the 38th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages},
year = {2011},
month = {January},
abstract = {We provide a new characterization of scheduling nondeterminism by allowing deterministic schedulers to delay their next-scheduled task. In limiting the delays an otherwise-deterministic scheduler is allowed, we discover concurrency bugs efficiently---by exploring few schedules---and robustly---i.e., independent of the number of tasks, context switches, or buffered events. Our characterization elegantly applies to any systematic exploration (e.g., testing, model checking) of concurrent programs with dynamic task-creation. Additionally, we show that certain delaying schedulers admit efficient reductions from concurrent to sequential program analysis.},
publisher = {Association for Computing Machinery, Inc.},
url = {http://approjects.co.za/?big=en-us/research/publication/delay-bounded-scheduling-2/},
edition = {Proceedings of the 38th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages},
}