Delay-bounded scheduling
From MaRDI portal
Publication:5408560
DOI10.1145/1926385.1926432zbMath1284.68087OpenAlexW4230480080MaRDI QIDQ5408560
Michael Emmi, Zvonimir Rakamarić, Shaz Qadeer
Publication date: 10 April 2014
Published in: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1926385.1926432
Related Items
Delay-bounded scheduling without delay!, SAT-Based Model Checking, A pragmatic approach to stateful partial order reduction, Reachability of scope-bounded multistack pushdown systems, Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency, Budget-bounded model-checking pushdown systems, The decidability of verification under PS 2.0, Bounded Context Switching for Valence Systems, Unnamed Item, Automatic analysis of DMA races using model checking and \(k\)-induction, Verification of Asynchronous Programs with Nested Locks