Tighter Loop Bound Analysis

Investor logo

Warning

This publication doesn't include Faculty of Economics and Administration. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

ČADEK Pavel STREJČEK Jan TRTÍK Marek

Year of publication 2016
Type Article in Proceedings
Conference Automated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016
MU Faculty or unit

Faculty of Informatics

Citation
Doi http://dx.doi.org/10.1007/978-3-319-46520-3_32
Field Informatics
Keywords loop bounds; symbolic execution
Description 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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.