LTL Model Checking of Parallel Programs with Under-Approximated
TSO Memory Model

D 2013

LTL Model Checking of Parallel Programs with Under-Approximated TSO Memory Model

BARNAT, Jiří, Luboš BRIM and Vojtěch HAVEL

Basic information

Original name

LTL Model Checking of Parallel Programs with Under-Approximated TSO Memory Model

Authors

BARNAT, Jiří (203 Czech Republic, belonging to the institution), Luboš BRIM (203 Czech Republic, belonging to the institution) and Vojtěch HAVEL (203 Czech Republic, guarantor, belonging to the institution)

Edition

Barcelona, Proceedings of Application of Concurrency to System Design, 2013, p. 51-59, 9 pp. 2013

Publisher

IEEE Computer Society

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

United States of America

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

printed version "print"

RIV identification code

RIV/00216224:14330/13:00070191

Organization unit

Faculty of Informatics

ISBN

978-0-7695-5035-0

ISSN

DOI

http://dx.doi.org/10.1109/ACSD.2013.8

UT WoS

000333827300006

Keywords in English

LTL model checking; divine model checker; relaxed memory model

Abstract

V originále

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.

Links

LG13010, research and development project

Name: Zastoupení ČR v European Research Consortium for Informatics and Mathematics (Acronym: ERCIM-CZ)

Investor: Ministry of Education, Youth and Sports of the CR

Citovat

BARNAT, Jiří, Luboš BRIM and Vojtěch HAVEL. LTL Model Checking of Parallel Programs with Under-Approximated TSO Memory Model. In Juan E. Guerrero. Proceedings of Application of Concurrency to System Design, 2013. Barcelona: IEEE Computer Society, 2013, p. 51-59. ISBN 978-0-7695-5035-0. Available from: https://dx.doi.org/10.1109/ACSD.2013.8.

@inproceedings{1130152,
   author = {Barnat, Jiří and Brim, Luboš and Havel, Vojtěch},
   address = {Barcelona},
   booktitle = {Proceedings of Application of Concurrency to System Design, 2013},
   doi = {http://dx.doi.org/10.1109/ACSD.2013.8},
   editor = {Juan E. Guerrero},
   keywords = {LTL model checking; divine model checker; relaxed memory model},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Barcelona},
   isbn = {978-0-7695-5035-0},
   pages = {51-59},
   publisher = {IEEE Computer Society},
   title = {LTL Model Checking of Parallel Programs with Under-Approximated TSO Memory Model},
   year = {2013}
}

TY  - JOUR
ID  - 1130152
AU  - Barnat, Jiří - Brim, Luboš - Havel, Vojtěch
PY  - 2013
TI  - LTL Model Checking of Parallel Programs with Under-Approximated TSO Memory Model
PB  - IEEE Computer Society
CY  - Barcelona
SN  - 9780769550350
KW  - LTL model checking
KW  - divine model checker
KW  - relaxed memory model
N2  - 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.
ER  -

BARNAT, Jiří, Luboš BRIM and Vojtěch HAVEL. LTL Model Checking of Parallel Programs with Under-Approximated TSO Memory Model. In Juan E. Guerrero. \textit{Proceedings of Application of Concurrency to System Design, 2013}. Barcelona: IEEE Computer Society, 2013, p.~51-59. ISBN~978-0-7695-5035-0. Available from: https://dx.doi.org/10.1109/ACSD.2013.8.

Detailed Information on Publication Record