Partial Order Aware Concurrency Sampling
| Autor: | Ronghui Gu, Junfeng Yang, Xinhao Yuan |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
SIMPLE (military communications protocol)
Computer science Distributed computing Concurrency Probabilistic logic Sampling (statistics) 020207 software engineering 02 engineering and technology Concurrent testing Javascript engine Order (business) 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Error detection and correction |
| Zdroj: | Computer Aided Verification ISBN: 9783319961415 CAV (2) |
| DOI: | 10.1007/978-3-319-96142-2_20 |
| Popis: | We present POS, a concurrency testing approach that samples the partial order of concurrent programs. POS uses a novel priority-based scheduling algorithm that dynamically reassigns priorities regarding the partial order information and formally ensures that each partial order will be explored with significant probability. POS is simple to implement and provides a probabilistic guarantee of error detection better than state-of-the-art sampling approaches. Evaluations show that POS is effective in covering the partial-order space of micro-benchmarks and finding concurrency bugs in real-world programs, such as Firefox’s JavaScript engine SpiderMonkey. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|