GUBS Upper Bound Solver (Extended Abstract)

Martin Avanzini
Michael Schaper

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.

In Guillaume Bonfante and Georg Moser: Proceedings 8th Workshop on Developments in Implicit Computational complExity and 5th Workshop on FOundational and Practical Aspects of Resource Analysis (DICE-FOPARA 2017), Uppsala, Sweden, April 22-23, 2017, Electronic Proceedings in Theoretical Computer Science 248, pp. 17–23.
Published: 18th April 2017.

ArXived at: http://dx.doi.org/10.4204/EPTCS.248.6 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org