arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.09818cs.LO
收藏

线性树约束

Linear Tree Constraints

Sabine Bauer, Martin Hofmann

摘要:

线性树约束是Hofmann和Rodriguez在面向对象程序的摊销资源分析中引入的。更准确地说,他们给出了从资源类型的推理到约束求解的简化。因此,一旦我们找到了一个算法来解决程序产生的约束,我们就可以从它们的解中读出资源消耗。这些约束的形式是用非负有理数标记的无限树之间的逐点线性不等式。我们感兴趣的问题,如果这样的约束系统是同时满足的。Bauer和Hofmann最近发现了树约束问题(UTC)的一个片段,它仍然足以用于程序分析,他们证明了UTC的列表情况是可判定的,而树的度至少为2的情况仍然是开放的。在本文中,我们解决这个问题。我们给出了一个决策过程,涵盖了资源分析所需的约束条件的整个范围。

英文摘要:

Linear tree constraints were introduced by Hofmann and Rodriguez in the context of amortized resource analysis for object oriented programs. More precisely, they gave a reduction from inference of resource types to constraint solving. Thus, once we have found an algorithm to solve the constraints generated from a program, we can read off the resource consumption from their solutions. These constraints have the form of pointwise linear inequalities between infinite trees labeled with nonnegative rational numbers. We are interested in the question if a system of such constraints is simultaneously satisfiable. Bauer and Hofmann have recently identified a fragment of the tree constraint problem (UTC) that is still sufficient for program analysis and they proved that the list case of UTC is decidable, whereas the case with trees of degree at least two remained open. In this paper, we solve this problem. We give a decision procedure that covers the entire range of constraints needed for resource analysis.

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

↑