Optimizing and Caching SMT Queries in SymDIVINE (Competition
Contribution)

D 2017

Optimizing and Caching SMT Queries in SymDIVINE (Competition Contribution)

MRÁZEK, Jan, Martin JONÁŠ, Vladimír ŠTILL, Henrich LAUKO, Jiří BARNAT et. al.

Basic information

Original name

Optimizing and Caching SMT Queries in SymDIVINE (Competition Contribution)

Authors

MRÁZEK, Jan (203 Czech Republic, belonging to the institution), Martin JONÁŠ (203 Czech Republic, belonging to the institution), Vladimír ŠTILL (203 Czech Republic, belonging to the institution), Henrich LAUKO (703 Slovakia, belonging to the institution) and Jiří BARNAT (203 Czech Republic, guarantor, belonging to the institution)

Edition

Berlin, Heidelberg, Tools and Algorithms for the Construction and Analysis of Systems, 23rd International Conference, TACAS 2017, Part II, p. 390-393, 4 pp. 2017

Publisher

Springer

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Germany

Confidentiality degree

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

Publication form

printed version "print"

References:

URL

Impact factor

Impact factor: 0.402 in 2005

RIV identification code

RIV/00216224:14330/17:00095131

Organization unit

Faculty of Informatics

ISBN

978-3-662-54579-9

ISSN

DOI

http://dx.doi.org/10.1007/978-3-662-54580-5_29

UT WoS

000440733400029

Keywords in English

program verification; model checking; formula optimizations; caching

Abstract

V originále

This paper presents a new version of the tool SymDIVINE, a model-checker for concurrent C/C++ programs. SymDIVINE uses a control-explicit data-symbolic approach to model checking, which allows for the bit-precise verification of programs with inputs, by representing data part of a program state by a first-order bit-vector formula. The new version of the tool employs a refined representation of symbolic states, which allows for efficient caching of smt queries. Moreover, the new version employs additional simplifications of first-order bit-vector formulas, such as elimination of unconstrained variables from quantified formulas. All changes are documented in detail in the paper.

Links

GA15-08772S, research and development project

Name: Analýza korektnosti vícevláknových programů v C a C++

Investor: Czech Science Foundation

MUNI/A/0897/2016, interní kód MU

Name: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace VI.

Investor: Masaryk University, Category A

MUNI/A/0992/2016, interní kód MU

Name: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity (Acronym: SKOMU)

Investor: Masaryk University, Category A

Citovat

MRÁZEK, Jan, Martin JONÁŠ, Vladimír ŠTILL, Henrich LAUKO and Jiří BARNAT. Optimizing and Caching SMT Queries in SymDIVINE (Competition Contribution). In Axel Legay, Tiziana Margaria. Tools and Algorithms for the Construction and Analysis of Systems, 23rd International Conference, TACAS 2017, Part II. Berlin, Heidelberg: Springer, 2017, p. 390-393. ISBN 978-3-662-54579-9. Available from: https://dx.doi.org/10.1007/978-3-662-54580-5_29.

@inproceedings{1394228,
   author = {Mrázek, Jan and Jonáš, Martin and Štill, Vladimír and Lauko, Henrich and Barnat, Jiří},
   address = {Berlin, Heidelberg},
   booktitle = {Tools and Algorithms for the Construction and Analysis of Systems, 23rd International Conference, TACAS 2017, Part II},
   doi = {http://dx.doi.org/10.1007/978-3-662-54580-5_29},
   editor = {Axel Legay, Tiziana Margaria},
   keywords = {program verification; model checking; formula optimizations; caching},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Berlin, Heidelberg},
   isbn = {978-3-662-54579-9},
   pages = {390-393},
   publisher = {Springer},
   title = {Optimizing and Caching SMT Queries in SymDIVINE (Competition Contribution)},
   url = {https://link.springer.com/chapter/10.1007/978-3-662-54580-5_29},
   year = {2017}
}

TY  - JOUR
ID  - 1394228
AU  - Mrázek, Jan - Jonáš, Martin - Štill, Vladimír - Lauko, Henrich - Barnat, Jiří
PY  - 2017
TI  - Optimizing and Caching SMT Queries in SymDIVINE (Competition Contribution)
PB  - Springer
CY  - Berlin, Heidelberg
SN  - 9783662545799
KW  - program verification
KW  - model checking
KW  - formula optimizations
KW  - caching
UR  - https://link.springer.com/chapter/10.1007/978-3-662-54580-5_29
N2  - This paper presents a new version of the tool SymDIVINE, a model-checker for concurrent C/C++ programs. SymDIVINE uses a control-explicit data-symbolic approach to model checking, which allows for the bit-precise verification of programs with inputs, by representing data part of a program state by a first-order bit-vector formula. The new version of the tool employs a refined representation of symbolic states, which allows for efficient caching of smt queries. Moreover, the new version employs additional simplifications of first-order bit-vector formulas, such as elimination of unconstrained variables from quantified formulas. All changes are documented in detail in the paper.
ER  -

MRÁZEK, Jan, Martin JONÁŠ, Vladimír ŠTILL, Henrich LAUKO and Jiří BARNAT. Optimizing and Caching SMT Queries in SymDIVINE (Competition Contribution). In Axel Legay, Tiziana Margaria. \textit{Tools and Algorithms for the Construction and Analysis of Systems, 23rd International Conference, TACAS 2017, Part II}. Berlin, Heidelberg: Springer, 2017, p.~390-393. ISBN~978-3-662-54579-9. Available from: https://dx.doi.org/10.1007/978-3-662-54580-5\_{}29.

Detailed Information on Publication Record