Lower bounds Analysis Tool for Integer Programs
C++ Shell Makefile
Clone or download
Pull request Compare This branch is 114 commits ahead, 1 commit behind mttnff:master.
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
example
src
.gitignore
COPYING
INSTALL.md
Makefile
README.md
benchscore.sh
benchstat.sh
dot2pdf.sh
splitdot2pdf.sh

README.md

LoAT

LoAT (Lower bounds Analysis Tool) is a tool to automatically infer lower bounds on the worst-case runtime complexity of integer programs (i.e. integer transition systems).

LoAT has been inspired by KoAT and uses a variation of ranking functions in combination with recurrence solving to prove lower bounds. The tool is based on the recurrence solver PURRS and the SMT solver Z3.

Paper

The technique behind LoAT is described in this paper.

Website

More information, a detailed evaluation and a static binary can be found on our website.

Build (for the impatient)

  • install LoAT-purrs
  • download and unpack the latest Z3 release
  • add /path/to/z3/bin to your LD_LIBRARY_PATH
  • adapt the Makefile
    • add -L/path/to/z3/bin to LINK_FLAGS
    • add -I/path/to/z3/include to COMPILE_FLAGS
  • make
  • for more detailed instructions, have a look at INSTALL.md