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

图变换系统的形状分析

Towards A Shape Analysis for Graph Transformation Systems

Dominik Steenken, Heike Wehrheim, Daniel Wonisch

摘要:

图和图转换系统是广泛的不同领域中经常使用的建模技术,覆盖了重构、网络拓扑或可重构软件等不同领域。作为一种形式化方法,图变换系统有助于形式化分析。这激发了各种验证方法的发展,特别是模型检验工具。在本文中,我们提出了一个验证技术的无限状态图转换系统。该技术采用的抽象原则中使用的形状分析的程序,总结可能无限多的节点,从而给出形状图。该技术已实现使用标准形状分析的3值逻辑基础。我们从铁路领域的一个例子上的方法。

英文摘要:

Graphs and graph transformation systems are a frequently used modelling technique for a wide range of different domains, cover- ing areas as diverse as refactorings, network topologies or reconfigurable software. Being a formal method, graph transformation systems lend themselves to a formal analysis. This has inspired the development of various verification methods, in particular also model checking tools. In this paper, we present a verification technique for infinite-state graph transformation systems. The technique employs the abstraction principle used in shape analysis of programs, summarising possibly infinitely many nodes thus giving shape graphs. The technique has been implemented using the 3-valued logical foundations of standard shape analysis. We exemplify the approach on an example from the railway domain.

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

↑