Reference : Transformation of Type Graphs with Inheritance for Ensuring Security in E-Government ...
Reports : External report
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/5614
Transformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks (Long Version)
English
Hermann, Frank mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Ehrig, Hartmut [> >]
Ermel, Claudia [> >]
2008
Technische Universität Berlin, Fak. IV
ISSN 1436-9915
2008/07
[en] E-government services usually process large amounts of confidential data. Therefore, security requirements for the communication between components have to be adhered in a strict way. Hence, it is of main interest that developers can analyze their modularized models of actual systems and that they can detect critical patterns. For this purpose, we present a general and formal framework for critical pattern detection and user-driven correction as well as possibilities for automatic analysis and verification at meta-model level. The technique is based on the formal theory of graph transformation, which we extend to transformations of type graphs with inheritance within a type graph hierarchy. We apply the framework to specify relevant security requirements. The extended theory is shown to fulfil the conditions of a weak adhesive HLR category allowing us to transfer analysis techniques and results shown for this abstract framework of graph transformation. In particular, we discuss how confluence analysis and parallelization can be used to enable parallel critical pattern detection and elimination.
http://hdl.handle.net/10993/5614
http://www.eecs.tu-berlin.de/fileadmin/f4/TechReports/2008/2008-07.pdf

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
2008-07.pdfPublisher postprint666.22 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.