Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1357166,
author = {Čadek, Pavel and Strejček, Jan and Trtík, Marek},
address = {Berlin, Heidelberg},
booktitle = {Automated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016},
doi = {http://dx.doi.org/10.1007/978-3-319-46520-3_32},
editor = {Cyrille Artho and Axel Legay and Doron Peled},
keywords = {loop bounds; symbolic execution},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Berlin, Heidelberg},
isbn = {978-3-319-46519-7},
pages = {512-527},
publisher = {Springer},
title = {Tighter Loop Bound Analysis},
year = {2016}
}
TY - JOUR
ID - 1357166
AU - Čadek, Pavel - Strejček, Jan - Trtík, Marek
PY - 2016
TI - Tighter Loop Bound Analysis
PB - Springer
CY - Berlin, Heidelberg
SN - 9783319465197
KW - loop bounds
KW - symbolic execution
N2 - We present a new algorithm for computing upper bounds on the number of executions of each program instruction during any single program run. The upper bounds are expressed as functions of program input values. The algorithm is primarily designed to produce bounds that are relatively tight, i.e. not unnecessarily blown up. The upper bounds for instructions allow us to infer loop bounds, i.e. upper bounds on the number of loop iterations. Experimental results show that the algorithm implemented in a prototype tool Looperman often produces tighter bounds than current tools for loop bound analysis.
ER -
ČADEK, Pavel, Jan STREJČEK and Marek TRTÍK. Tighter Loop Bound Analysis. In Cyrille Artho and Axel Legay and Doron Peled. \textit{Automated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016}. Berlin, Heidelberg: Springer. p.~512-527. ISBN~978-3-319-46519-7. doi:10.1007/978-3-319-46520-3\_{}32. 2016.
|
