Policy Analysis and Verification by Graph Transformation Tools | Zendy

Francesco Parisi-Presicce | Zendy; Yujie Zhao | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Policy Analysis and Verification by Graph Transformation Tools

Author(s) -

Francesco Parisi-Presicce,

Yujie Zhao

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.12.031

Subject(s) - graph rewriting , computer science , graph , theoretical computer science , static analysis , graph theory , transformation (genetics) , distributed computing , programming language , mathematics , biochemistry , chemistry , combinatorics , gene

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research