Annegret Habel

	2011
59		Rachid Echahed, Annegret Habel, Mohamed Mosbah: Graph Computation Models. ECEASST 39: (2011)
	2010
58		Hartmut Ehrig, Annegret Habel, Leen Lambers, Fernando Orejas, Ulrike Golas: Local Confluence for Rules with Nested Application Conditions. ICGT 2010: 330-345
57		Ulrike Golas, Hartmut Ehrig, Annegret Habel: Multi-Amalgamation in Adhesive Categories. ICGT 2010: 346-361
56		Frank Drewes, Annegret Habel, Berthold Hoffmann, Detlef Plump: Manipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday. ECEASST 26: (2010)
55		Hartmut Ehrig, Annegret Habel, Leen Lambers: Parallelism and Concurrency Theorems for Rules with Nested Application Conditions. ECEASST 26: (2010)
54		Annegret Habel, Hendrik Radke: Expressiveness of graph conditions with variables. ECEASST 30: (2010)
	2009
53		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
52		Karl Azab, Annegret Habel: High-Level Programs and Program Conditions. ICGT 2008: 211-225
51		Mohamed Mosbah, Annegret Habel: Workshop on Graph Computation Models. ICGT 2008: 460-462
	2006
50		Annegret Habel, Karl-Heinz Pennemann: Satisfiability of High-Level Conditions. ICGT 2006: 430-444
49		Annegret Habel, Karl-Heinz Pennemann, Arend Rensink: Weakest Preconditions for High-Level Programs. ICGT 2006: 445-460
48		Karl Azab, Annegret Habel, Karl-Heinz Pennemann, Christian Zuckschwerdt: ENFORCe: A System for Ensuring Formal Correctness of High-level Programs. ECEASST 1: (2006)
47		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)
46		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
45		Ralf Reussner, Jens Happe, Annegret Habel: Modelling Parametric Contracts and the State Space of Composite Components by Graph Grammars. FASE 2005: 80-95
44		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
43		Hartmut Ehrig, Annegret Habel, Julia Padberg, Ulrike Prange: Adhesive High-Level Replacement Categories and Systems. ICGT 2004: 144-160
42		Annegret Habel, Berthold Hoffmann: Parallel Independence in Hierarchical Graph Transformation. ICGT 2004: 178-193
41		Hartmut Ehrig, Karsten Ehrig, Annegret Habel, Karl-Heinz Pennemann: Constraints and Application Conditions: From Graphs to High-Level Structures. ICGT 2004: 287-303
	2002
40		Annegret Habel, Detlef Plump: Relabelling in Graph Transformation. ICGT 2002: 135-147
	2001
39		Annegret Habel, Detlef Plump: Computational Completeness of Programming Languages Based on Graph Transformation. FoSSaCS 2001: 230-245
38		Hartmut Ehrig, Annegret Habel, Francesco Parisi-Presicce: Basic Results for Two Types of High-Level Replacement Systems. Electr. Notes Theor. Comput. Sci. 51: 127-138 (2001)
37		Annegret Habel, Detlef Plump: Solving Equations by Graph Transformation. Electr. Notes Theor. Comput. Sci. 51: 165-176 (2001)
36		Annegret Habel, Jürgen Müller, Detlef Plump: Double-pushout graph transformation revisited. Mathematical Structures in Computer Science 11(5): 637-688 (2001)
	1999
35		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
34		Annegret Habel, Jürgen Müller, Detlef Plump: Double-Pushout Approach with Injective Matching. TAGT 1998: 103-116
33		Annegret Habel, Detlef Plump: Complete Strategies for Term Graph Narrowing. WADT 1998: 152-167
	1997
32		Frank Drewes, Hans-Jörg Kreowski, Annegret Habel: Hyperedge Replacement, Graph Grammars. Handbook of Graph Grammars 1997: 95-162
	1996
31		Annegret Habel, Reiko Heckel, Gabriele Taentzer: Graph Grammars with Negative Application Conditions. Fundam. Inform. 26(3/4): 287-313 (1996)
30		Annegret Habel, Detlef Plump: Term Graph Narrowing. Mathematical Structures in Computer Science 6(6): 649-676 (1996)
	1995
29		Annegret Habel, Detlef Plump: Unification, rewriting, and narrowing on term graphs. Electr. Notes Theor. Comput. Sci. 2: 110-117 (1995)
28		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
27		Jürgen Dassow, Annegret Habel, Stefan Taubenberger: Chain-Code Pictures and Collages Generated by Hyperedge Replacement. TAGT 1994: 412-427
26		Detlef Plump, Annegret Habel: Graph Unification and Matching. TAGT 1994: 75-88
	1993
25		Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger: Generating Self-Affine Fractals by Collage Grammars. Developments in Language Theory 1993: 278-289
24		Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, S. Traubenberger: A scetch of Collage Grammars. Bulletin of the EATCS 50: 209-219 (1993)
23		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
22		Annegret Habel: Hyperedge Replacement: Grammars and Languages Springer 1992
21		Annegret Habel: Hypergraph Grammars: Transformational and Algorithmic Aspects. Elektronische Informationsverarbeitung und Kybernetik 28(5): 241-277 (1992)
	1991
20		Annegret Habel, Hans-Jörg Kreowski, Detlef Plump: Jungle evaluation. Fundam. Inform. 15(1): 37-60 (1991)
19		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)
18		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
17		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
16		Annegret Habel, Hans-Jörg Kreowski: Collage Grammars. Graph-Grammars and Their Application to Computer Science 1990: 411-429
	1989
15		Annegret Habel, Hans-Jörg Kreowski, Walter Vogler: Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar. TAPSOFT, Vol.1 1989: 275-289
14		Annegret Habel, Hans-Jörg Kreowski: Filtering Hyperedge-Replacement Through Compatible Properties. WG 1989: 107-120
13		Annegret Habel, Hans-Jörg Kreowski, Walter Vogler: Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages. Acta Inf. 26(7): 657-677 (1989)
12		Annegret Habel: Hyperedge replacement - grammars and languages. Universität Bremen 1989: 1-193
	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

Coauthor Index

1	Marc Andries	[35]
2	Karl Azab	[48] [52]
3	Paul Boehm	[2] [3] [6]
4	Jürgen Dassow	[27]
5	Frank Drewes	[24] [25] [28] [32] [56]
6	Rachid Echahed	[59]
7	Hartmut Ehrig	[3] [17] [19] [38] [41] [43] [46] [47] [55] [57] [58]
8	Karsten Ehrig	[41] [46]
9	Gregor Engels	[35]
10	Harald-Reto Fonio	[2] [6]
11	Ulrike Golas (Ulrike Prange)	[43] [47] [57] [58]
12	Jens Happe	[45]
13	Reiko Heckel	[31]
14	Berthold Hoffmann	[35] [42] [56]
15	Udo Hummert	[3]
16	Hans-Jörg Kreowski	[1] [4] [5] [7] [8] [9] [10] [13] [14] [15] [16] [17] [18] [19] [20] [23] [24] [25] [28] [32] [35]
17	Sabine Kuske	[35]
18	Leen Lambers	[55] [58]
19	Clemens Lautemann	[23]
20	Mohamed Mosbah	[51] [59]
21	Jürgen Müller	[34] [36]
22	Fernando Orejas	[58]
23	Julia Padberg	[43] [47]
24	Francesco Parisi-Presicce	[17] [19] [38]
25	Karl-Heinz Pennemann	[41] [44] [46] [48] [49] [50] [53]
26	Detlef Plump	[10] [20] [26] [29] [30] [33] [34] [35] [36] [37] [39] [40] [56]
27	Hendrik Radke	[54]
28	Arend Rensink	[49]
29	Ralf Reussner (Ralf H. Reussner)	[45]
30	Andy Schürr	[35]
31	Gabriele Taentzer	[31] [35]
32	Stefan Taubenberger	[25] [27] [28]
33	S. Traubenberger	[24]
34	Walter Vogler	[7] [13] [15] [18]
35	Christian Zuckschwerdt	[48]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page