循环程序的紧多项式最坏情况界
Tight Polynomial Worst-Case Bounds for Loop Programs
AI总结:
本文针对有界循环命令式程序,提出一种算法,能获得渐近紧的多变量析取多项式上界,并利用森林分解定理完成完整求解。
摘要:
2008年,Ben-Amram、Jones和Kristiansen证明,对于一种简单的编程语言——表示具有有界循环的非确定性命令式程序,且算术仅限于加法和乘法——可以精确判定程序是否具有某些增长率性质,特别是计算值或程序运行时间是否具有多项式增长率。一个自然且引人入胜的问题是,从回答判定问题转向给出定量结果,即紧的多项式上界。本文展示了如何为此类程序获得渐近紧的、多变量的、析取的多项式界。这是一个完整的解决方案:只要多项式界存在,它就会被找到。令人惊喜的是,该算法相当简单;但它依赖于一些微妙的推理。证明中的一个重要成分是森林分解定理,这是关于同态到有限幺半群的强结构结果。
英文摘要:
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 move from answering the decision problem to giving a quantitative result, namely, a tight polynomial upper bound. This paper shows how to obtain asymptotically-tight, multivariate, disjunctive polynomial bounds for this class of programs. This is a complete solution: whenever a polynomial bound exists it will be found. A pleasant surprise is that the algorithm is quite simple; but it relies on some subtle reasoning. An important ingredient in the proof is the forest factorization theorem, a strong structural result on homomorphisms into a finite monoid.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。