Abstract
Dynamic Partial Order Reduction (DPOR) is a powerful technique used in verification and testing to reduce the number of equivalent executions explored. Two executions are equivalent if they can be obtained from each other by swapping adjacent, non-conflicting (inde-pendent) execution steps. Existing DPOR algorithms rely on a notion of independence that is context-insensitive, i.e., the execution steps must be independent in all contexts. In practice, independence is often proved by just checking no execution step writes on a shared variable. We present context-sensitive DPOR, an extension of DPOR that uses context-sensitive independence, where two steps might be independent only in the particular context explored. We show theoretically and experimentally how context-sensitive DPOR can achieve exponential gains.
Original language | English |
---|---|
Title of host publication | Computer Aided Verification |
Subtitle of host publication | 29th International Conference, CAV 2017 Heidelberg, Germany, July 24–28, 2017, Proceedings, Part I |
Editors | Rupak Majumdar, Viktor Kunčak |
Place of Publication | Berlin Germany |
Publisher | Springer |
Pages | 526-543 |
Number of pages | 18 |
ISBN (Electronic) | 9783319633879 |
ISBN (Print) | 9783319633862 |
DOIs | |
Publication status | Published - 2017 |
Event | Computer Aided Verification 2017 - Heidelberg, Germany Duration: 24 Jul 2017 → 28 Jul 2017 Conference number: 29th http://cavconference.org/2017/ |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 10426 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | Computer Aided Verification 2017 |
---|---|
Abbreviated title | CAV 2017 |
Country/Territory | Germany |
City | Heidelberg |
Period | 24/07/17 → 28/07/17 |
Internet address |