GUBS上界求解器(扩展摘要)

DICE-FOPARA@ETAPS Pub Date : 2017-04-19 DOI:10.4204/EPTCS.248.6

Martin Avanzini, Michael Schaper

{"title":"GUBS上界求解器(扩展摘要)","authors":"Martin Avanzini, Michael Schaper","doi":"10.4204/EPTCS.248.6","DOIUrl":null,"url":null,"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.","PeriodicalId":196864,"journal":{"name":"DICE-FOPARA@ETAPS","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"GUBS Upper Bound Solver (Extended Abstract)\",\"authors\":\"Martin Avanzini, Michael Schaper\",\"doi\":\"10.4204/EPTCS.248.6\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":196864,\"journal\":{\"name\":\"DICE-FOPARA@ETAPS\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DICE-FOPARA@ETAPS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.248.6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DICE-FOPARA@ETAPS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.248.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在这个扩展摘要中，我们给出了GUBS上界解算器。GUBS是针对由未解释的函数符号和标准算术运算形成的不等式的自然约束求解器。GUBS现在构成了HoSA的主干，HoSA是一种自动分析高阶函数程序的空间和时间复杂性的工具。我们给出了关于实施的见解，并报告了不同的案例研究。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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 complexity of higher-order functional programs automatically. We give insights about the implemen- tation and report different case studies.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

DICE-FOPARA@ETAPS

自引率

0.00%

发文量