Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1576598,
author = {Ročkai, Petr and Lauko, Henrich and Olliaro, Martina and Cortesi, Agostino},
address = {Cham},
booktitle = {Model Checking Software},
doi = {http://dx.doi.org/10.1007/978-3-030-30923-7_5},
editor = {Fabrizio Biondi, Thomas Given-Wilson, Axel Legay},
keywords = {Symbolic Computation; String Abstraction; DIVINE; LLVM; Transformation; Verification; Model Checking; C; C++},
howpublished = {elektronická verze "online"},
language = {eng},
location = {Cham},
isbn = {978-3-030-30922-0},
pages = {74-93},
publisher = {Springer International Publishing},
title = {String Abstraction for Model Checking of C Programs},
url = {https://link.springer.com/chapter/10.1007%2F978-3-030-30923-7_5},
year = {2019}
}
TY - JOUR
ID - 1576598
AU - Ročkai, Petr - Lauko, Henrich - Olliaro, Martina - Cortesi, Agostino
PY - 2019
TI - String Abstraction for Model Checking of C Programs
PB - Springer International Publishing
CY - Cham
SN - 9783030309220
KW - Symbolic Computation
KW - String Abstraction
KW - DIVINE
KW - LLVM
KW - Transformation
KW - Verification
KW - Model Checking
KW - C
KW - C++
UR - https://link.springer.com/chapter/10.1007%2F978-3-030-30923-7_5
L2 - https://link.springer.com/chapter/10.1007%2F978-3-030-30923-7_5
N2 - Automatic abstraction is a powerful software verification technique. In this paper, we elaborate an abstract domain for C strings, that is, null-terminated arrays of characters. We describe the abstract semantics of basic string operations and prove their soundness with regards to previously established concrete semantics of those operations. In addition to a selection of string functions from the standard C library, we provide semantics for character access and update, enabling automatic lifting of arbitrary string-manipulating code into the domain. The domain we present (called M-String) has two other abstract domains as its parameters: an index (bound) domain and a character domain. Picking different constituent domains allows M-String to be tailored for specific verification tasks, balancing precision against complexity. In addition to describing the domain theoretically, we also provide an executable implementation of the abstract operations. Using a tool which automatically lifts existing programs into the M-String domain along with an explicit-state model checker, we have evaluated the proposed domain experimentally on a few simple but realistic test programs.
ER -
ROČKAI, Petr, Henrich LAUKO, Martina OLLIARO and Agostino CORTESI. String Abstraction for Model Checking of C Programs. In Fabrizio Biondi, Thomas Given-Wilson, Axel Legay. \textit{Model Checking Software}. Cham: Springer International Publishing. p.~74-93. ISBN~978-3-030-30922-0. doi:10.1007/978-3-030-30923-7\_{}5. 2019.
|
