Internet Archive Scholar

Tight Worst-Case Bounds for Polynomial Loop Programs [chapter]

Amir M. Ben-Amram, Geoff W. Hamilton
2019 Green Chemistry and Sustainable Technology  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (423.1 kB)
https://web.archive.org/web/20190503104720/https://link.springer.com/content/pdf/10.1007%2F978-3-030-17127-8_5.pdf

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 application/pdf.

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. This
more » ... paper shows how to obtain asymptoticallytight multivariate polynomial bounds for this class of programs. This is a complete solution: whenever a polynomial bound exists it will be found.
doi:10.1007/978-3-030-17127-8_5 dblp:conf/fossacs/Ben-AmramH19 fatcat:zf2kgwcnsnhsjdbqwy2fr574pa
Citation

Amir M. Ben-Amram, Geoff W. Hamilton. "Tight Worst-Case Bounds for Polynomial Loop Programs." Green Chemistry and Sustainable Technology (2019) 80-97