arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1504.02611cs.SEcs.DCcs.LOcs.PL
收藏

面向对象并发模型的实用图验证

Towards Practical Graph-Based Verification for an Object-Oriented Concurrency Model

Alexander Heußner, Christopher M. Poskitt, Claudio Corrodi, Benjamin Morandi

摘要:

为了利用多核和分布式平台的强大功能,并使软件工程师更容易开发并发软件,已经提出了不同的面向对象的并发模型,如SCOOP。尽管分析SCOOP程序的实际重要性,目前还没有通用的验证方法,直接对程序代码进行操作,而无需额外的注释。其中一个原因是SCOOP的大量部分冲突的语义形式化(无论是在理论上还是在实现上)。在这里,我们提出了一个简单的图形转换系统(GTS)为SCOOP的运行时语义,掌握所有已知的语义语言的最常见的功能。这个运行时模型是在最先进的GTS工具GROOVE中实现的,它使我们能够模拟,分析和验证SCOOP程序的一个子集的死锁和其他行为属性。除了提出第一种方法来验证SCOOP程序的自动翻译GTS,我们还强调我们的经验,应用GTS(特别是GROOVE)指定语义的形式,运行时模型,这应该是转移到GTS模型的其他并发语言和库。

英文摘要:

To harness the power of multi-core and distributed platforms, and to make the development of concurrent software more accessible to software engineers, different object-oriented concurrency models such as SCOOP have been proposed. Despite the practical importance of analysing SCOOP programs, there are currently no general verification approaches that operate directly on program code without additional annotations. One reason for this is the multitude of partially conflicting semantic formalisations for SCOOP (either in theory or by-implementation). Here, we propose a simple graph transformation system (GTS) based run-time semantics for SCOOP that grasps the most common features of all known semantics of the language. This run-time model is implemented in the state-of-the-art GTS tool GROOVE, which allows us to simulate, analyse, and verify a subset of SCOOP programs with respect to deadlocks and other behavioural properties. Besides proposing the first approach to verify SCOOP programs by automatic translation to GTS, we also highlight our experiences of applying GTS (and especially GROOVE) for specifying semantics in the form of a run-time model, which should be transferable to GTS models for other concurrent languages and libraries.

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

↑