ŠTILL, Vladimír, Petr ROČKAI and Jiří BARNAT. Context-Switch-Directed Verification in DIVINE. In Petr Hliněný, Zdeněk Dvořák, Jiří Jaroš, Jan Kofroň, Jan Kořenek, Petr Matula, Karel Pala. Mathematical and Engineering Methods in Computer Science. Neuveden: Springer International Publishing, 2014, p. 135-146. ISBN 978-3-319-14895-3. Available from: https://dx.doi.org/10.1007/978-3-319-14896-0_12.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Context-Switch-Directed Verification in DIVINE
Authors ŠTILL, Vladimír (203 Czech Republic, guarantor, belonging to the institution), Petr ROČKAI (703 Slovakia, belonging to the institution) and Jiří BARNAT (203 Czech Republic, belonging to the institution).
Edition Neuveden, Mathematical and Engineering Methods in Computer Science, p. 135-146, 12 pp. 2014.
Publisher Springer International Publishing
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Switzerland
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/14:00084599
Organization unit Faculty of Informatics
ISBN 978-3-319-14895-3
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-319-14896-0_12
UT WoS 000357573300012
Keywords in English model checking; LLVM; context-switch bounded verification
Tags International impact, Reviewed
Changed by Changed by: RNDr. Vladimír Štill, Ph.D., učo 373979. Changed: 9/11/2015 12:23.
Abstract
In model checking of real-life C and C++ programs, both search efficiency and counterexample readability are very important. In this paper, we suggest context-switch-directed exploration as a way to find a well-readable counterexample faster. Furthermore, we allow to limit the number of context switches used in state-space exploration if desired. The new algorithm is implemented in the DIVINE model checker and enables both unbounded and bounded context-switch-directed exploration for models given in LLVM bitcode, which efficiently allows for verification of multi-threaded C and C++ programs.
Links
MUNI/A/0855/2013, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace III. (Acronym: FI MAV III.)
Investor: Masaryk University, Category A
PrintDisplayed: 19/7/2024 01:33