arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.00097cs.PLcs.CCcs.LOmath.LO
收藏

pymwp:一个保证C程序复杂性边界的工具

pymwp: A Tool for Guaranteeing Complexity Bounds for C Programs

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

摘要:

复杂性分析提供了程序运行时行为的保证,但现有的自动化技术仍然无法分析大类程序,mwp流分析避开了现有方法的许多困难,并提供了有趣的特征,如组合性,多变量边界,适用于非终止程序。它分析资源使用情况,并确定程序的变量增长率是否仅与其输入大小多项式相关。这听起来然而,微积分是计算昂贵的操作,并提供没有反馈,如果程序没有多项式bounds.That两个默认值在以前的工作中解决,并准备为我们在这里介绍的工具:pymwp,一个静态复杂性分析器为C程序的基础上,我们改进的mwp流分析。

英文摘要:

Complexity analysis offers assurance of program's runtime behavior, but large classes of programs remain unanalyzable by existing automated techniques.The mwp-flow analysis sidesteps many difficulties shared by existing approaches, and offers interesting features, such as compositionality, multivariate bounds, and applicability to non-terminating programs.It analyzes resource usage and determines if a program's variables growth rates are no more than polynomially related to their inputs sizes.This sound calculus, however, is computationally expensive to manipulate, and provides no feedback if the program does not have polynomial bounds.Those two defaults were addressed in a previous work, and prepared for the tool we present here: pymwp, a static complexity analyzer for C programs based on our improved mwp-flow analysis.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑