Ranger: A Tool for Bounds Analysis of Heap-Manipulating Programs
FIEDOR, T. HOLÍK, L. ROGALEWICZ, A. VOJNAR, T. SINN, M. ZULEGER, F.
Ranger is an extension of the Forester tool, which transforms input heap-manipulating programs into corresponding arithmetic programs, which can be subsequently analysed using termination or bounds analysers. Its method is based on finding so called numerical measures (norms), such as lengths of lists or longest paths in trees, and based on results of shape analysis infer a set of changes, which are subsequently transformed to arithmetic statements. The resulting programs are then analysed using bounds analyser (in particular, the Loopus tool). The precise handling of the changes allows analysis of programs requiring amortized reasoning.
forest automata bounds analysis arithmetic program generation shape analysis amortized complexity numerical measures
Nástroj a dodatečné informace se nacházejí na http://www.fit.vutbr.cz/research/groups/verifit/tools/ranger/ a https://pajda.fit.vutbr.cz/ifiedortom/forester-resource-bounds