arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1106.1228cs.LOcs.SE
收藏

基于递归组件库的综合

Synthesis from Recursive-Components Libraries

Yoad Lustig, Moshe Vardi

摘要:

综合是根据系统的规范自动构造系统。在经典的综合算法中,它总是假设系统是“从头开始构建”,而不是由可重用的组件组成。当然,这在现实生活中很少发生。在现实生活中,几乎每一个重要的商业软件系统都严重依赖于使用可重用组件库。此外,其他上下文,如Web服务编排,可以建模为从组件库合成系统。2009年,我们引入了基于可重用组件库的LTL合成。在这里,我们扩展的工作和学习的综合从组件库与“调用和返回”的控制流结构。这种控制流结构在软件系统中非常常见。我们定义的嵌套词时序逻辑(NWTL)的递归组件库,其中NWTL是一个规范的形式主义,比LTL更丰富,这是适合于“调用和返回”的计算合成的问题。我们解决了这个问题,提供了一个综合算法,并显示该问题是2EXPTIME完全的,作为标准的综合。

英文摘要:

Synthesis is the automatic construction of a system from its specification. In classical synthesis algorithms it is always assumed that the system is "constructed from scratch" rather than composed from reusable components. This, of course, rarely happens in real life. In real life, almost every non-trivial commercial software system relies heavily on using libraries of reusable components. Furthermore, other contexts, such as web-service orchestration, can be modeled as synthesis of a system from a library of components. In 2009 we introduced LTL synthesis from libraries of reusable components. Here, we extend the work and study synthesis from component libraries with "call and return"' control flow structure. Such control-flow structure is very common in software systems. We define the problem of Nested-Words Temporal Logic (NWTL) synthesis from recursive component libraries, where NWTL is a specification formalism, richer than LTL, that is suitable for "call and return" computations. We solve the problem, providing a synthesis algorithm, and show the problem is 2EXPTIME-complete, as standard synthesis.

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

↑