2026-04-13T08:12:27Zhttps://recercat.cat/oai/request

oai:recercat.cat:10256/181102024-06-18T12:17:59Zcom_2072_452955com_2072_2054col_2072_453069

00925njm 22002777a 4500 dc Albert, Elvira author Bofill Arasa, Miquel author Borralleras, Cristina author Martín-Martín, Enrique author Rubio, Albert author info:eu-repo/date/embargoEnd/2020-09-20 2019-09-20 When programs feature a complex control flow, existing techniques for resource analysis produce cost relation systems (CRS) whose cost functions retain the complex flow of the program and, consequently, might not be solvable into closed-form upper bounds. This paper presents a novel approach to resource analysis that is driven by the result of a termination analysis. The fundamental idea is that the termination proof encapsulates the flows of the program which are relevant for the cost computation so that, by driving the generation of the CRS using the termination proof, we produce a linearly-bounded CRS (LB-CRS). A LB-CRS is composed of cost functions that are guaranteed to be locally bounded by linear ranking functions and thus greatly simplify the process of CRS solving. We have built a new resource analysis tool, named MaxCore, that is guided by the VeryMax termination analyzer and uses CoFloCo and PUBS as CRS solvers. Our experimental results on the set of benchmarks from the Complexity and Termination Competition 2019 for C Integer programs show that MaxCore outperforms all other resource analysis tools This work was funded partially by the Spanish MICINN/FEDER, UE projects RTI2018-094403-BC31, RTI2018-094403-B-C33 and RTI2018-095609-B-I00, the MINECO project TIN2015-69175-C4-2-R, the MINECO/FEDER, UE projects TIN2015-69175-C4-3-R and TIN2015-66293-R, and by the CM project S2018/TCS-4314 http://hdl.handle.net/10256/18110 Programació lògica Logic programming Programació (Matemàtica) Programming (Mathematics) Resource Analysis driven by (Conditional) Termination Proofs