2009 | ||
---|---|---|
52 | EE | Annegret Habel, Karl-Heinz Pennemann: Correctness of high-level transformation systems relative to nested conditions. Mathematical Structures in Computer Science 19(2): 245-296 (2009) |
2008 | ||
51 | EE | Karl Azab, Annegret Habel: High-Level Programs and Program Conditions. ICGT 2008: 211-225 |
50 | EE | Mohamed Mosbah, Annegret Habel: Workshop on Graph Computation Models. ICGT 2008: 460-462 |
2006 | ||
49 | EE | Annegret Habel, Karl-Heinz Pennemann: Satisfiability of High-Level Conditions. ICGT 2006: 430-444 |
48 | EE | Annegret Habel, Karl-Heinz Pennemann, Arend Rensink: Weakest Preconditions for High-Level Programs. ICGT 2006: 445-460 |
47 | EE | Karl Azab, Annegret Habel, Karl-Heinz Pennemann, Christian Zuckschwerdt: ENFORCe: A System for Ensuring Formal Correctness of High-level Programs. ECEASST 1: (2006) |
46 | EE | Hartmut Ehrig, Julia Padberg, Ulrike Prange, Annegret Habel: Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation. Fundam. Inform. 74(1): 1-29 (2006) |
45 | EE | Hartmut Ehrig, Karsten Ehrig, Annegret Habel, Karl-Heinz Pennemann: Theory of Constraints and Application Conditions: From Graphs to High-Level Structures. Fundam. Inform. 74(1): 135-166 (2006) |
2005 | ||
44 | EE | Ralf Reussner, Jens Happe, Annegret Habel: Modelling Parametric Contracts and the State Space of Composite Components by Graph Grammars. FASE 2005: 80-95 |
43 | EE | Annegret Habel, Karl-Heinz Pennemann: Nested Constraints and Application Conditions for High-Level Structures. Formal Methods in Software and Systems Modeling 2005: 293-308 |
2004 | ||
42 | EE | Hartmut Ehrig, Annegret Habel, Julia Padberg, Ulrike Prange: Adhesive High-Level Replacement Categories and Systems. ICGT 2004: 144-160 |
41 | EE | Annegret Habel, Berthold Hoffmann: Parallel Independence in Hierarchical Graph Transformation. ICGT 2004: 178-193 |
40 | EE | Hartmut Ehrig, Karsten Ehrig, Annegret Habel, Karl-Heinz Pennemann: Constraints and Application Conditions: From Graphs to High-Level Structures. ICGT 2004: 287-303 |
2002 | ||
39 | EE | Annegret Habel, Detlef Plump: Relabelling in Graph Transformation. ICGT 2002: 135-147 |
2001 | ||
38 | EE | Annegret Habel, Detlef Plump: Computational Completeness of Programming Languages Based on Graph Transformation. FoSSaCS 2001: 230-245 |
37 | EE | Hartmut Ehrig, Annegret Habel, Francesco Parisi-Presicce: Basic Results for Two Types of High-Level Replacement Systems. Electr. Notes Theor. Comput. Sci. 51: (2001) |
36 | EE | Annegret Habel, Detlef Plump: Solving Equations by Graph Transformation. Electr. Notes Theor. Comput. Sci. 51: (2001) |
35 | Annegret Habel, Jürgen Müller, Detlef Plump: Double-pushout graph transformation revisited. Mathematical Structures in Computer Science 11(5): 637-688 (2001) | |
1999 | ||
34 | Marc Andries, Gregor Engels, Annegret Habel, Berthold Hoffmann, Hans-Jörg Kreowski, Sabine Kuske, Detlef Plump, Andy Schürr, Gabriele Taentzer: Graph Transformation for Specification and Programming. Sci. Comput. Program. 34(1): 1-54 (1999) | |
1998 | ||
33 | Annegret Habel, Jürgen Müller, Detlef Plump: Double-Pushout Approach with Injective Matching. TAGT 1998: 103-116 | |
32 | EE | Annegret Habel, Detlef Plump: Complete Strategies for Term Graph Narrowing. WADT 1998: 152-167 |
1997 | ||
31 | Frank Drewes, Hans-Jörg Kreowski, Annegret Habel: Hyperedge Replacement, Graph Grammars. Handbook of Graph Grammars 1997: 95-162 | |
1996 | ||
30 | Annegret Habel, Reiko Heckel, Gabriele Taentzer: Graph Grammars with Negative Application Conditions. Fundam. Inform. 26(3/4): 287-313 (1996) | |
29 | Annegret Habel, Detlef Plump: Term Graph Narrowing. Mathematical Structures in Computer Science 6(6): 649-676 (1996) | |
1995 | ||
28 | EE | Annegret Habel, Detlef Plump: Unification, rewriting, and narrowing on term graphs. Electr. Notes Theor. Comput. Sci. 2: (1995) |
27 | EE | Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger: Generating Self-Affine Fractals by Collage Grammars. Theor. Comput. Sci. 145(1&2): 159-187 (1995) |
1994 | ||
26 | Jürgen Dassow, Annegret Habel, Stefan Taubenberger: Chain-Code Pictures and Collages Generated by Hyperedge Replacement. TAGT 1994: 412-427 | |
25 | Detlef Plump, Annegret Habel: Graph Unification and Matching. TAGT 1994: 75-88 | |
1993 | ||
24 | Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger: Generating Self-Affine Fractals by Collage Grammars. Developments in Language Theory 1993: 278-289 | |
23 | Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, S. Traubenberger: A scetch of Collage Grammars. Bulletin of the EATCS 50: 209-219 (1993) | |
22 | Annegret Habel, Hans-Jörg Kreowski, Clemens Lautemann: A Comparison of Compatible, Finite, and Inductive Graph Properties. Theor. Comput. Sci. 110(1): 145-168 (1993) | |
1992 | ||
21 | Annegret Habel: Hyperedge Replacement: Grammars and Languages Springer 1992 | |
20 | Annegret Habel: Hypergraph Grammars: Transformational and Algorithmic Aspects. Elektronische Informationsverarbeitung und Kybernetik 28(5): 241-277 (1992) | |
1991 | ||
19 | Annegret Habel, Hans-Jörg Kreowski, Detlef Plump: Jungle evaluation. Fundam. Inform. 15(1): 37-60 (1991) | |
18 | Hartmut Ehrig, Annegret Habel, Hans-Jörg Kreowski, Francesco Parisi-Presicce: Parallelism and Concurrency in High-Level Replacement Systems. Mathematical Structures in Computer Science 1(3): 361-404 (1991) | |
17 | Annegret Habel, Hans-Jörg Kreowski, Walter Vogler: Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement. Theor. Comput. Sci. 89(1): 33-62 (1991) | |
1990 | ||
16 | Hartmut Ehrig, Annegret Habel, Hans-Jörg Kreowski, Francesco Parisi-Presicce: From Graph Grammars to High Level Replacement Systems. Graph-Grammars and Their Application to Computer Science 1990: 269-291 | |
15 | Annegret Habel, Hans-Jörg Kreowski: Collage Grammars. Graph-Grammars and Their Application to Computer Science 1990: 411-429 | |
1989 | ||
14 | Annegret Habel, Hans-Jörg Kreowski, Walter Vogler: Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar. TAPSOFT, Vol.1 1989: 275-289 | |
13 | Annegret Habel, Hans-Jörg Kreowski: Filtering Hyperedge-Replacement Through Compatible Properties. WG 1989: 107-120 | |
12 | Annegret Habel, Hans-Jörg Kreowski, Walter Vogler: Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages. Acta Inf. 26(7): 657-677 (1989) | |
1988 | ||
11 | Annegret Habel: Graph-Theoretic Properties Compatible with Graph Derivations. WG 1988: 11-29 | |
1987 | ||
10 | Annegret Habel, Hans-Jörg Kreowski, Detlef Plump: Jungle Evaluation. ADT 1987: 92-112 | |
9 | Annegret Habel, Hans-Jörg Kreowski: Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement. STACS 1987: 207-219 | |
8 | Annegret Habel, Hans-Jörg Kreowski: Pretty Patterns Produced by Hyperedge Replacement. WG 1987: 32-45 | |
7 | Annegret Habel, Hans-Jörg Kreowski, Walter Vogler: Complativle graph properties are decidable for hypergraph replacement graph languages. Bulletin of the EATCS 33: 55-61 (1987) | |
6 | Paul Boehm, Harald-Reto Fonio, Annegret Habel: Amalgamation of Graph Transformations: A Synchronization Mechanism. J. Comput. Syst. Sci. 34(2/3): 377-408 (1987) | |
5 | Annegret Habel, Hans-Jörg Kreowski: Characteristics of Graph Languages Generated by Edge Replacement. Theor. Comput. Sci. 51: 81-115 (1987) | |
1986 | ||
4 | Annegret Habel, Hans-Jörg Kreowski: May we introduce to you: hyperedge replacement. Graph-Grammars and Their Application to Computer Science 1986: 15-26 | |
3 | Hartmut Ehrig, Annegret Habel, Udo Hummert, Paul Boehm: Towards algebraic data types grammars: a junction between algebraic specification and graph grammars. Bulletin of the EATCS 29: 22-26 (1986) | |
1985 | ||
2 | Paul Boehm, Harald-Reto Fonio, Annegret Habel: Amalgamation of Graph Transformations with Applications to Synchronization. TAPSOFT, Vol.1 1985: 267-283 | |
1982 | ||
1 | Annegret Habel, Hans-Jörg Kreowski: On context-free gragh languages generated by edge replacement. Graph-Grammars and Their Application to Computer Science 1982: 143-158 |