Please use this identifier to cite or link to this item:
For citation please use:
Main Title: Transformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks (Long Version)
Author(s): Hermann, Frank
Ehrig, Hartmut
Ermel, Claudia
Type: Research Paper
Has Version: 10.1007/978-3-642-00593-0_22
Language Code: en
Abstract: 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.
Issue Date: 2008
Date Available: 17-Jun-2020
DDC Class: 004 Datenverarbeitung; Informatik
Subject(s): graph transformation
type hierarchy
Series: Forschungsberichte der Fakultät IV - Elektrotechnik und Informatik / Technische Universität Berlin
Series Number: 2008-07
ISSN: 1436-9915
Appears in Collections:Fak. 4 Elektrotechnik und Informatik » Publications

Files in This Item:
Format: Adobe PDF | Size: 666.22 kB
DownloadShow Preview

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.