Informace o publikaci

Tighter Loop Bound Analysis

Autoři

ČADEK Pavel STREJČEK Jan TRTÍK Marek

Druh Článek ve sborníku
Konference Automated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
Doi http://dx.doi.org/10.1007/978-3-319-46520-3_32
Obor Informatika
Klíčová slova loop bounds; symbolic execution
Popis 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.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.

Další info