GUBS Upper Bound Solver (Extended Abstract)
Logic in Computer Science
2017-04-20 v1
Abstract
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.
Cite
@article{arxiv.1704.05586,
title = {GUBS Upper Bound Solver (Extended Abstract)},
author = {Martin Avanzini and Michael Schaper},
journal= {arXiv preprint arXiv:1704.05586},
year = {2017}
}
Comments
In Proceedings DICE-FOPARA 2017, arXiv:1704.05169