Policy Analysis and Verification by Graph Transformation Tools

被引：2

作者：

Parisi-Presicce, Francesco ^{[1
]}

Zhao, Yujie ^{[1
]}

机构：

[1] George Mason Univ, Fairfax, VA 22030 USA

来源：

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2005年 / 127卷 / 01期

关键词：

verification; policy languages; conflicts;

D O I：

10.1016/j.entcs.2004.12.031

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Policies are used to control the behavior of large-scale systems. After policies are designed and before policies are implemented, it should be possible to analyze the policies and verify that they behave as expected. Graph transformations provide a good method to carry out the analysis and verification because of the intuitive representation of policies and the mature theory. Here, we show how graph transformations can simulate PONDER policies and use the graph tools AGG and GROOVE to do the static and dynamic analysis.

引用

页码：101 / 112

页数：12

共 9 条

[1]

Damianou N., 2000, 2001 DOC IMP COLL

[2]

Damianou N., 2001, LECT NOTES COMP SCI, V1995

[3]

Koch M, 2002, LECT NOTES COMPUT SC, V2505, P223

[4]

Koch M., P SACMAT 2001, P121

[5] Conflicts in policy-based distributed systems management [J].

Lupu, EC ;

Sloman, M .

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1999, 25 (06) :852-869

[6]

Lymberopoulos L., 2003, DMTF GLOB MAN C SAN

[7]

MOLDOVAN D, 1987, LECT NOTES COMPUT SC, V291, P427

[8]

Rensink A, 2003, LECT NOTES COMPUT SC, V3062, P479

[9]

Taentzer G., LECT NOTES COMP SCI, V1779, P481

← 1 →