ŠTILL, Vladimír and Jiří BARNAT. Model Checking of C++ Programs Under the x86-TSO Memory Model. In Jing Sun, Meng Sun. Formal Methods and Software Engineering. Cham: Springer. p. 124-140. ISBN 978-3-030-02449-9. doi:10.1007/978-3-030-02450-5_8. 2018.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Model Checking of C++ Programs Under the x86-TSO Memory Model
Authors ŠTILL, Vladimír (203 Czech Republic, guarantor, belonging to the institution) and Jiří BARNAT (203 Czech Republic, belonging to the institution).
Edition Cham, Formal Methods and Software Engineering, p. 124-140, 17 pp. 2018.
Publisher Springer
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10200 1.2 Computer and information sciences
Country of publisher Switzerland
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
WWW Publisher's page Author's page
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/18:00101450
Organization unit Faculty of Informatics
ISBN 978-3-030-02449-9
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-030-02450-5_8
UT WoS 000672801600008
Keywords in English relaxed memory; model checking; c++; x86; memory model; DIVINE
Tags firank_B
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 30/4/2019 07:36.
Abstract
In this work, we present an extension of the DIVINE model checker that allows for analysis of C and C++ programs under the Open image in new window relaxed memory model. We use an approach in which the program to be verified is first transformed, so that it itself encodes the relaxed memory behavior, and after that it is verified by an explicit-state model checker supporting only the standard sequentially consistent memory. The novelty of our approach is in a careful design of an encoding of Open image in new window operations so that the nondeterminism introduced by the relaxed memory simulation is minimized. In particular, we allow for nondeterminism only in connection with memory fences and load operations of those memory addresses that were written to by a preceding store. We evaluate and compare our approach with the state-of-the-art bounded model checker CBMC and stateless model checker Nidhugg. For the comparison we employ SV-COMP concurrency benchmarks that do not exhibit data nondeterminism, and we show that our solution built on top of the explicit-state model checker outperforms both of the other tools. The implementation is publicly available as an open source software.
Links
GA18-02177S, research and development projectName: Abstrakce a jiné techniky v semi-symbolické verifikaci programů
Investor: Czech Science Foundation
MUNI/A/0854/2017, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace VII.
Investor: Masaryk University, Category A
MUNI/A/1038/2017, interní kód MUName: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity 18
Investor: Masaryk University, Category A
PrintDisplayed: 19/4/2024 09:45