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

关于SCOOP程序的验证

On the Verification of SCOOP Programs

Georgiana Caltais, Bertrand Meyer

摘要:

在本文中,我们专注于开发一个工具箱,用于在SCOOP的背景下验证程序-一个优雅的并发模型,最近正式重写逻辑(RL)和Maude的基础上。SCOOP是实现在埃菲尔铁塔和它的适用性也证明了从实际的角度来看,在该地区的机器人编程。我们的贡献在于设计和集成的别名分析器和考夫曼死锁检测器的屋顶下相同的RL为基础的语义框架的SCOOP。这使得Maude重写引擎及其LTL模型检查器能够“免费”使用,以便执行感兴趣的分析。我们讨论了我们的模型检查死锁的方法的局限性,并提供解决方案的状态爆炸问题。后者主要是由SCOOP形式化的大小引起的,SCOOP形式化包含了真正并发模型的所有方面。在别名方面,我们提出了一个扩展以前介绍的别名演算的基础上的程序表达式,无限的程序执行,如无限循环和递归调用的设置。此外,我们设计了一个相应的可执行规范,易于实现的SCOOP形式化的顶部。我们的扩展的一个重要属性是,在非并发设置中,相应的别名表达式可以在正则表达式的概念方面过度近似。这进一步使我们能够推导出一种算法,该算法总是停止并提供“可能混叠”信息的合理过度近似,其中合理性代表缺乏假阴性。

英文摘要:

In this paper we focus on the development of a toolbox for the verification of programs in the context of SCOOP -- an elegant concurrency model, recently formalized based on Rewriting Logic (RL) and Maude. SCOOP is implemented in Eiffel and its applicability is demonstrated also from a practical perspective, in the area of robotics programming. Our contribution consists in devising and integrating an alias analyzer and a Coffman deadlock detector under the roof of the same RL-based semantic framework of SCOOP. This enables using the Maude rewriting engine and its LTL model-checker "for free", in order to perform the analyses of interest. We discuss the limitations of our approach for model-checking deadlocks and provide solutions to the state explosion problem. The latter is mainly caused by the size of the SCOOP formalization which incorporates all the aspects of a real concurrency model. On the aliasing side, we propose an extension of a previously introduced alias calculus based on program expressions, to the setting of unbounded program executions such as infinite loops and recursive calls. Moreover, we devise a corresponding executable specification easily implementable on top of the SCOOP formalization. An important property of our extension is that, in non-concurrent settings, the corresponding alias expressions can be over-approximated in terms of a notion of regular expressions. This further enables us to derive an algorithm that always stops and provides a sound over-approximation of the "may aliasing" information, where soundness stands for the lack of false negatives.

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

↑