LTL Model Checking of Parallel Programs with Under-Approximated TSO Memory Model
| Authors | |
|---|---|
| Year of publication | 2013 |
| Type | Article in Proceedings |
| Conference | Proceedings of Application of Concurrency to System Design, 2013 |
| MU Faculty or unit | |
| Citation | |
| Doi | http://dx.doi.org/10.1109/ACSD.2013.8 |
| Field | Informatics |
| Keywords | LTL model checking; divine model checker; relaxed memory model |
| Description | Model checking of parallel programs under relaxed memory models has been so far limited to the verification of safety properties. Tools have been developed to automatically synthesise correct placement of synchronisation primitives to reinstate the sequential consistency. However, in practice it is not the sequential consistency that is demanded, but the correctness of the program with respect to its specification. In this paper, we introduce a new explicit-state Linear Temporal Logic model checking procedure that allows for full verification of programs under approximated Total Store Ordering memory model. We also present a workflow of automated procedure to place the synchronisation primitives into the system under inspection to make it satisfy the given specification under the approximated memory model. Our experimental evaluation has been conducted within DiVinE, our parallel and distributed-memory LTL model checker. |
| Related projects: |