GUBS Upper Bound Solver (Extended 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 complexit...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Open Publishing Association
2017-04-01
|
| Series: | Electronic Proceedings in Theoretical Computer Science |
| Online Access: | http://arxiv.org/pdf/1704.05586v1 |
| _version_ | 1818554473809707008 |
|---|---|
| author | Martin Avanzini Michael Schaper |
| author_facet | Martin Avanzini Michael Schaper |
| author_sort | Martin Avanzini |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-12T09:39:57Z |
| format | Article |
| id | doaj.art-02e2232b6c16421b8d470efa3200beeb |
| institution | Directory Open Access Journal |
| issn | 2075-2180 |
| language | English |
| last_indexed | 2024-12-12T09:39:57Z |
| publishDate | 2017-04-01 |
| publisher | Open Publishing Association |
| record_format | Article |
| series | Electronic Proceedings in Theoretical Computer Science |
| spelling | doaj.art-02e2232b6c16421b8d470efa3200beeb2022-12-22T00:28:34ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802017-04-01248Proc. DICE-FOPARA 2017172310.4204/EPTCS.248.6:6GUBS Upper Bound Solver (Extended Abstract)Martin AvanziniMichael SchaperIn 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.http://arxiv.org/pdf/1704.05586v1 |
| spellingShingle | Martin Avanzini Michael Schaper GUBS Upper Bound Solver (Extended Abstract) Electronic Proceedings in Theoretical Computer Science |
| title | GUBS Upper Bound Solver (Extended Abstract) |
| title_full | GUBS Upper Bound Solver (Extended Abstract) |
| title_fullStr | GUBS Upper Bound Solver (Extended Abstract) |
| title_full_unstemmed | GUBS Upper Bound Solver (Extended Abstract) |
| title_short | GUBS Upper Bound Solver (Extended Abstract) |
| title_sort | gubs upper bound solver extended abstract |
| url | http://arxiv.org/pdf/1704.05586v1 |
| work_keys_str_mv | AT martinavanzini gubsupperboundsolverextendedabstract AT michaelschaper gubsupperboundsolverextendedabstract |