Ranger: A Tool for Bounds Analysis of Heap-Manipulating Programs

Authors:Fiedor Tomáš, Holík Lukáš, Rogalewicz Adam, Sinn Moritz, Vojnar Tomáš, Zuleger Florian
Licence:required - no fee
Keywords:forest automata
bounds analysis
arithmetic program generation
shape analysis
amortized complexity
numerical measures
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.
The tool and manual is located at http://www.fit.vutbr.cz/research/groups/verifit/tools/ranger/ and at https://github.com/tfiedor/ranger
Research groups:
Licence terms:
Free software under the terms of GNU GPL (cf.http://www.gnu.org/licenses/gpl.html).

Your IPv4 address:
Switch to IPv6 connection

DNSSEC [dnssec]