TY  - CHAP
A1  - Fan, Yang
A1  - Masuhara, Hidehiko
A1  - Aotani, Tomoyuki
A1  - Nielson, Flemming
A1  - Nielson, Hanne Riis
T1  - AspectKE*: Security aspects with program analysis for distributed systems
N2  - Enforcing security policies to distributed systems is difficult, in particular, when a system contains untrusted components. We designed AspectKE*, a distributed AOP language based on a tuple space, to tackle this issue. In AspectKE*, aspects can enforce access control policies that depend on future behavior of running processes. One of the key language features is the predicates and functions that extract results of static program analysis, which are useful for defining security aspects that have to know about future behavior of a program. AspectKE* also provides a novel variable binding mechanism for pointcuts, so that pointcuts can uniformly specify join points based on both static and dynamic information about the program. Our implementation strategy performs fundamental static analysis at load-time, so as to retain runtime overheads minimal. We implemented a compiler for AspectKE*, and demonstrate usefulness of AspectKE* through a security aspect for a distributed chat system.
KW  - aspect oriented programming
KW  - program analysis
KW  - security policies
KW  - distributed systems
KW  - tuple spaces
Y1  - 2010
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-41369
ER  - 
TY  - GEN
A1  - Ehrig, Hartmut
A1  - Golas, Ulrike
A1  - Habel, Annegret
A1  - Lambers, Leen
A1  - Orejas, Fernando
T1  - M-adhesive transformation systems with nested application conditions
BT  - Part 1: parallelism, concurrency and amalgamation
T2  - Postprints der Universität Potsdam : Digital Engineering Reihe
N2  - Nested application conditions generalise the well-known negative application conditions and are important for several application domains. In this paper, we present Local Church-Rosser, Parallelism, Concurrency and Amalgamation Theorems for rules with nested application conditions in the framework of M-adhesive categories, where M-adhesive categories are slightly more general than weak adhesive high-level replacement categories. Most of the proofs are based on the corresponding statements for rules without application conditions and two shift lemmas stating that nested application conditions can be shifted over morphisms and rules.
T3  - Zweitveröffentlichungen der Universität Potsdam : Reihe der Digital Engineering Fakultät - 1 
KW  - level-replacement systems
KW  - graph-transformations
KW  - distributed systems
KW  - synchronization
KW  - confluence
KW  - categories
KW  - programs
KW  - grammars
KW  - model
Y1  - 2020
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-415651
IS  - 001
ER  -