用于程序复杂度分析的解密策略
Declassification Policy for Program Complexity Analysis
AI总结:
针对基于非干涉的复杂度分析类型系统内延不完备、表达力受限的问题,提出一种保留FP可靠性的解密策略,可捕获更多程序,还能刻画BFF类且类型推断为多项式时间。
摘要:
在自动化复杂度分析中,基于非干涉的类型系统通过可靠性(soundness)静态保证:良类型程序所计算的函数属于给定复杂度类,例如多项式时间可计算函数类FP。这些刻画在外延上是完备的——即能覆盖所有函数——但在内延上并不完备,因为部分多项式时间算法会被拒绝。这种对表达能力的影响,是实现易处理刻画所付出的不可避免的代价。为解决该问题,安全领域的一条研究思路是:基于解密机制对非干涉进行放宽,允许关键数据以安全、可控的方式被释放。沿着这一方向,我们提出了一种全新且直观的解密策略,该策略保留了FP可靠性,且能捕获的程序严格多于现有基于非干涉的系统。我们展示了该方法的通用性:它还在含一阶过程调用的二阶命令式语言中,给出了二阶多项式时间可计算函数类BFF的全新刻画。其类型推断是易处理的,可在多项式时间内完成。
英文摘要:
In automated complexity analysis, noninterference-based type systems statically guarantee, via soundness, the property that well-typed programs compute functions of a given complexity class, e.g., the class FP of functions computable in polynomial time. These characterizations are also extensionally complete -- they capture all functions -- but are not intensionally complete as some polytime algorithms are rejected. This impact on expressive power is an unavoidable cost of achieving a tractable characterization. To overcome this issue, an avenue arising from security applications is to find a relaxation of noninterference based on a declassification mechanism that allows critical data to be released in a safe and controlled manner. Following this path, we present a new and intuitive declassification policy preserving FP-soundness and capturing strictly more programs than existing noninterference-based systems. We show the versatility of the approach: it also provides a new characterization of the class BFF of second-order polynomial time computable functions in a second-order imperative language, with first-order procedure calls. Type inference is tractable: it can be done in polynomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。