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.
Other formats:   BibTeX LaTeX RIS
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
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher United States of America
Confidentiality degree is not subject to a state or trade secret
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 1550-4808
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
Tags firank_B
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 29/4/2014 08:44.
Abstract
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 projectName: Zastoupení ČR v European Research Consortium for Informatics and Mathematics (Acronym: ERCIM-CZ)
Investor: Ministry of Education, Youth and Sports of the CR
PrintDisplayed: 21/8/2024 21:33