递归方程在静态代价分析中的序理论框架——非线性不等式不变式的动态推断
An Order Theory Framework of Recurrence Equations for Static Cost Analysis $-$ Dynamic Inference of Non-Linear Inequality Invariants
AI总结:
本文针对静态代价分析中递归方程求解的局限性,提出了一种基于序理论的框架,将递归视为算子、解视为不动点,利用前/后缀点搜索技术设计新求解器,实验证明其能高效推断出复杂递归的非线性上下界。
摘要:
递归方程在静态代价分析中一直发挥着核心作用,它们可以被视为程序的抽象,并用于在不实际运行带有具体数据的程序的情况下推断资源使用信息。此类信息通常表示为输入数据大小的函数。更一般地,递归方程越来越多地被用于自动获取非线性数值不变式。然而,在处理由代价分析产生的(复杂)递归特征时,最先进的递归求解器和代价分析器存在严重的局限性。我们通过开发一个新颖的序理论框架来解决这一挑战,在该框架中,递归被视为算子,其解被视为不动点,这使得我们能够利用强大的前/后缀点搜索技术。我们证明了有用的性质,并提供了使我们能够开发技术并将它们结合起来设计新求解器的原则和见解。我们还实现并实验评估了所提出方法的基于优化的实例化。结果非常令人鼓舞:我们的原型优于最先进的代价分析器和递归求解器,并且能够在合理的时间内,为表示各种程序行为的复杂递归推断出紧致的非线性下/上界。
英文摘要:
Recurrence equations have played a central role in static cost analysis, where they can be viewed as abstractions of programs and used to infer resource usage information without actually running the programs with concrete data. Such information is typically represented as functions of input data sizes. More generally, recurrence equations have been increasingly used to automatically obtain non-linear numerical invariants. However, state-of-the-art recurrence solvers and cost analysers suffer from serious limitations when dealing with the (complex) features of recurrences arising from cost analyses. We address this challenge by developing a novel order-theoretical framework where recurrences are viewed as operators and their solutions as fixpoints, which allows leveraging powerful pre/postfixpoint search techniques. We prove useful properties and provide principles and insights that enable us to develop techniques and combine them to design new solvers. We have also implemented and experimentally evaluated an optimisation-based instantiation of the proposed approach. The results are quite promising: our prototype outperforms state-of-the-art cost analysers and recurrence solvers, and can infer tight non-linear lower/upper bounds, in a reasonable time, for complex recurrences representing diverse program behaviours.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。