11 search results - page 2 / 3 » From Algebraic Graph Transformation to Adhesive HLR Categori... |
GG
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different...
FASE
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. E-government services usually process large amounts of confidential data. Therefore, security requirements for the communication between components have to be adhered in...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, , ) such that L and R are termgraphs representing...
WADT
1997
Springer
13 years 10 months ago
1997
Springer
The dynamic behavior of rule-based systems (like term rewriting systems 24], process algebras 27], and so on) can be traditionally determined in two orthogonal ways. Either operati...
RTA
2009
Springer
14 years 27 days ago
2009
Springer
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, τ, σ) such that L and R are termgraphs represen...