A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Green Chemistry and Sustainable Technology
In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language-representing non-deterministic imperative programs with bounded loops, and arithmetics limited to addition and multiplication-it is possible to decide precisely whether a program has certain growth-rate properties, in particular whether a computed value, or the program's running time, has a polynomial growth rate. A natural and intriguing problem was to improve the precision of the information obtained. Thisdoi:10.1007/978-3-030-17127-8_5 dblp:conf/fossacs/Ben-AmramH19 fatcat:zf2kgwcnsnhsjdbqwy2fr574pa