Electronic Proceedings in Theoretical Computer Science (Apr 2017)

GUBS Upper Bound Solver (Extended Abstract)

  • Martin Avanzini,
  • Michael Schaper

DOI
https://doi.org/10.4204/EPTCS.248.6
Journal volume & issue
Vol. 248, no. Proc. DICE-FOPARA 2017
pp. 17 – 23

Abstract

Read online

In this extended abstract we present the GUBS Upper Bound Solver. GUBS is a dedicated constraint solver over the naturals for inequalities formed over uninterpreted function symbols and standard arithmetic operations. GUBS now forms the backbone of HoSA, a tool for analysing space and time complexity of higher-order functional programs automatically. We give insights about the implemen- tation and report different case studies.