Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1110971,
author = {Slabý, Jiří and Strejček, Jan and Trtík, Marek},
address = {Berlin Heidelberg},
booktitle = {11th International Symposium on Automated Technology for Verification and Analysis, ATVA 2013},
doi = {http://dx.doi.org/10.1007/978-3-319-02444-8_15},
editor = {Hung Dang-Van and Mizuhito Ogawa},
keywords = {symbolic execution; compact symbolic execution; testing},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Berlin Heidelberg},
isbn = {978-3-319-02443-1},
pages = {193-207},
publisher = {Springer},
title = {Compact Symbolic Execution},
year = {2013}
}
TY - JOUR
ID - 1110971
AU - Slabý, Jiří - Strejček, Jan - Trtík, Marek
PY - 2013
TI - Compact Symbolic Execution
PB - Springer
CY - Berlin Heidelberg
SN - 9783319024431
KW - symbolic execution
KW - compact symbolic execution
KW - testing
N2 - We present a generalisation of King’s symbolic execution technique called compact symbolic execution. It proceeds in two steps. First, we analyse cyclic paths in the control flow graph of a given program, independently from the rest of the program. Our goal is to compute a so called template for each such a cyclic path. A template is a declarative parametric description of all possible program states, which may leave the analysed cyclic path after any number of iterations along it. In the second step, we execute the program symbolically with the templates in hand. The result is a compact symbolic execution tree. A compact tree always carry the same information in all its leaves as the corresponding classic symbolic execution tree. Nevertheless, a compact tree is typically substantially smaller than the corresponding classic tree. There are even programs for which compact symbolic execution trees are finite while classic symbolic execution trees are infinite.
ER -
SLABÝ, Jiří, Jan STREJČEK a Marek TRTÍK. Compact Symbolic Execution. In Hung Dang-Van and Mizuhito Ogawa. \textit{11th International Symposium on Automated Technology for Verification and Analysis, ATVA 2013}. Berlin Heidelberg: Springer. s.~193-207. ISBN~978-3-319-02443-1. doi:10.1007/978-3-319-02444-8\_{}15. 2013.
|
