Tighter Loop Bound Analysis

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F16%3A00088246" target="_blank" >RIV/00216224:14330/16:00088246 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-46520-3_32" target="_blank" >http://dx.doi.org/10.1007/978-3-319-46520-3_32</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-46520-3_32" target="_blank" >10.1007/978-3-319-46520-3_32</a>

Result language
angličtina
Original language name
Tighter Loop Bound Analysis
Original language 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.
Czech name
—
Czech description
—

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Automated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016
ISBN
9783319465197
ISSN
0302-9743
e-ISSN
—
Number of pages
16
Pages from-to
512-527
Publisher name
Springer
Place of publication
Berlin, Heidelberg
Event location
Chiba, Japan
Event date
Jan 1, 2016
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)