Prof. Dr. Annegret Habel

Address:	Prof. Dr. Annegret Habel University of Oldenburg Faculty II Department of Computing Science D-26111 Oldenburg Germany
Room:	A2 2-205
Phone:	+49 441 798-2998
Fax:	+49 441 798-2965
email:	Annegret.Habel

 

Research

• Generalized Graph Transformation
• Correct Graph Transformation Systems

Projects

• DFG project "Development of Correct Graph Transformation Systems"
• ESPRIT Working Group RTN Network SegraVis (Syntactic and Semantic Integration of Visual Modeling Techniques)
• ESPRIT Working Group ESPRIT Working Group APPLIGRAPH (Applications of Graph Transformation)
• ESPRIT Working Group TMR Research Network GETGRATS (General Theory of Graph Transformation Systems)

Memberships in program committees

• ICGT 2008 - 4th International Conference on Graph Transformation in Leicester (UK), September 7 - 13, 2008
• GMC 2008 - 2nd Workshop on Graph Computation Models. Satellite event of ICGT 2008 in Leicester (UK), September, 2008
• TERMGRAPH 2007, 4th Int. Workshop on Term and Graph Rewriting, Porto, 2007. Satellite workshop of ETAPS 2007
• GMC 2006 - Workshop on Graph Computation Models 2006. Satellite event of ICGT 2006 in Natal (Brazil), 18 September, 2006

Publications

[HP08]

Annegret Habel and Karl-Heinz Pennemann. Correctness of high-level transformation systems relative to nested conditions. Mathematical Structures in Computer Science, 2008. To appear.
[ .pdf ]

[AH08]

Karl Azab and Annegret Habel. High-level programs and program conditions. In Graph Transformations (ICGT'08), volume 5214 of Lecture Notes in Computer Science, pages 211-225. Springer-Verlag, 2008.
[ .pdf ]

[AHPZ07]

Karl Azab, Annegret Habel, Karl-Heinz Pennemann, and Christian Zuckschwerdt. ENFORCe: A system for ensuring formal correctness of high-level programs. In Proc. 3rd International Workshop on Graph Based Tools (GraBaTs'06), volume 1, pages 82-93. Electronic Communications of EASST, 2007.
[ .pdf ]

[HPR06b]

Annegret Habel, Karl-Heinz Pennemann, and Arend Rensink. Weakest preconditions for high-level programs (long version). Berichte aus dem Department für Informatik 8/06, 35 pages, Universität Oldenburg, 2006.
[ .pdf ]

[HPR06a]

Annegret Habel, Karl-Heinz Pennemann, and Arend Rensink. Weakest preconditions for high-level programs. In Graph Transformations (ICGT'06), volume 4178 of Lecture Notes in Computer Science, pages 445-460. Springer-Verlag, 2006.
[ .pdf ]

[HP06]

Annegret Habel and Karl-Heinz Pennemann. Satisfiability of high-level conditions. In Graph Transformations (ICGT'06), volume 4178 of Lecture Notes in Computer Science, pages 430-444. Springer-Verlag, 2006.
[ .pdf ]

[EHPP06]

Hartmut Ehrig, Annegret Habel, Julia Padberg, and Ulrike Prange. Adhesive high-level replacement systems: A new categorical framework for graph transformation. Fundamenta Informaticae, 74:1-29, 2006.
[ .pdf ]

[EEHP06]

Hartmut Ehrig, Karsten Ehrig, Annegret Habel, and Karl-Heinz Pennemann. Theory of constraints and application conditions: From graphs to high-level structures. Fundamenta Informaticae, 74:135-166, 2006.
[ .ps.gz ]

[RHH05]

Ralf Reussner, Jens Happe, and Annegret Habel. Modeling parametric component contracts and the state space of composite components by graph grammars. In Fundamental Approaches to Software Engineering (FASE'05), volume 3442 of Lecture Notes in Computer Science, pages 80-95. Springer-Verlag, 2005.
[ .pdf ]

[HP05]

Annegret Habel and Karl-Heinz Pennemann. Nested constraints and application conditions for high-level structures. In Hans-Jörg Kreowski, Ugo Montanari, Fernando Orejas, Grzegorz Rozenberg, and Gabriele Taentzer, editors, Formal Methods in Software and System Modeling, volume 3393 of Lecture Notes in Computer Science, pages 294-308. Springer-Verlag, 2005.
[ .ps.gz ]

[EEHP04]

Hartmut Ehrig, Karsten Ehrig, Annegret Habel, and Karl-Heinz Pennemann. Constraints and application conditions: From graphs to high-level structures. In Graph Transformation (ICGT'04), volume 3256 of Lecture Notes in Computer Science, pages 287-303. Springer-Verlag, 2004.
[ .ps.gz ]

[EHPP04]

Hartmut Ehrig, Annegret Habel, Julia Padberg, and Ulrike Prange. Adhesive high-level replacement categories and systems. In Graph Transformation (ICGT'04), volume 3256 of Lecture Notes in Computer Science, pages 144-160. Springer-Verlag, 2004.
[ .pdf ]

[HH04]

Annegret Habel and Berthold Hoffmann. Parallel independence in hierachical graph transformation. In Graph Transformation (ICGT'04), volume 3256 of Lecture Notes in Computer Science, pages 178-193. Springer-Verlag, 2004.
[ .ps.gz ]

[HP02b]

Annegret Habel and Detlef Plump. Relabelling in graph transformation. In Graph Transformation, First International Conference, ICGT 2002, volume 2505 of Lecture Notes in Computer Science, pages 135-147. Springer-Verlag, 2002.
[ .ps.gz ]

[HP02a]

Annegret Habel and Detlef Plump. A core language for graph transformation (extended abstract). In Hans-Jörg Kreowski and Peter Knirsch, editors, Proc. Applied Graph Transformation (AGT'2002), pages 187-199, 2002.

[EHP02]

Hartmut Ehrig, Annegret Habel, and Francesco Parisi-Presicce. Basic results for two types of high-level replacement systems. In GETGRATS, volume 51 of Electronic Notes in Theoretical Computer Science, page 12, 2002.

[HP02c]

Annegret Habel and Detlef Plump. Solving equations by graph transformation. In GETGRATS, volume 51 of Electronic Notes in Theoretical Computer Science, page 12, 2002.

[HMP01]

Annegret Habel, Jürgen Müller, and Detlef Plump. Double-pushout graph transformation revisited. Mathematical Structures in Computer Science, 11(5):637-688, 2001.
[ .ps.gz ]

[HP01]

Annegret Habel and Detlef Plump. Computational completeness of programming languages basedon graph transformation. In Proc. Foundations of Software Science and Computation Structures (FOSSACS 2001), volume 2030 of Lecture Notes in Computer Science, pages 230-245. Springer-Verlag, 2001.
[ .ps.gz ]

[HMP00]

Annegret Habel, Jürgen Müller, and Detlef Plump. Double-pushout approach with injective matching. In Theory and Application of Graph Transformations, volume 1764 of Lecture Notes in Computer Science, pages 103-116. Springer-Verlag, 2000.

[AEH⁺99]

Marc Andries, Gregor Engels, Annegret Habel, Berthold Hoffmann, Hans-Jörg Kreowski, Sabine Kuske, Detlef Plump, Andy Schürr, and Gabriele Taentzer. Graph transformation for specification and programming. Science of Computer Programming, 34(1):1-54, 1999.

[HP99]

Annegret Habel and Detlef Plump. Complete strategies for term graph narrowing. In Jose Luiz Fiadeiro, editor, Recent Trends in Algebraic Development Techniques, Selected Papers, volume 1589 of Lecture Notes in Computer Science, pages 152-167. Springer-Verlag, 1999.

[HK98]

Annegret Habel and Renate Klempien-Hinrichs. Atom replacement in hypergraphs (extended abstract). In G. Engels and G. Rozenberg, editors, TAGT'98 - 6th International Worshop on Theory and Application of Graph Transformation, Bericht tr-ri-98-201, Reihe Informatik, pages 182-189. Universität-GH Paderborn, 1998.
[ .ps.gz ]

[DHK97]

Frank Drewes, Annegret Habel, and Hans-Jörg Kreowski. Hyperedge replacement graph grammars. In Grzegorz Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, volume 1, chapter 2, pages 95-162. World Scientific, 1997.

[DHT96]

Jürgen Dassow, Annegret Habel, and Stefan Taubenberger. Chain-code pictures and collages generated by hyperedge replacement. In Graph Grammars and Their Application to Computer Science, volume 1073 of Lecture Notes in Computer Science, pages 412-427. Springer-Verlag, 1996.

[HHT96]

Annegret Habel, Reiko Heckel, and Gabriele Taentzer. Graph grammars with negative application conditions. Fundamenta Informaticae, 26:287-313, 1996.

[HP96]

Annegret Habel and Detlef Plump. Term graph narrowing. Mathematical Structures in Computer Science, 6:649-676, 1996.

[PH96]

Detlef Plump and Annegret Habel. Graph unification and matching. In J. Cuny, H. Ehrig, G. Engels, and G. Rozenberg, editors, Graph Grammars and Their Application to Computer Science, volume 1073 of Lecture Notes in Computer Science, pages 75-89. Springer-Verlag, 1996.
[ .ps.gz ]

[DHKT95]

Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, and Stefan Taubenberger. Generating self-affine fractals by collage grammars. Theoretical Computer Science, 145:159-187, 1995.

[HP95]

Annegret Habel and Detlef Plump. Unification, rewriting, and narrowing on term graphs. In Proc. Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 95), volume 2 of Electronic Notes in Theoretical Computer Science, pages 35-42. Elsevier, 1995.

[DHKT94]

Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, and Stefan Taubenberger. Generating self-affine fractals by collage grammars. In Grzegorz Rozenberg and Arto Salomaa, editors, Developments in Language Theory, pages 278-289. World Scientific, 1994.

[DHKT93]

Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, and Stefan Taubenberger. A sketch of collage grammars. Bull. EATCS, volume 50, pages 209-219, 1993.

[HKL93]

Annegret Habel, Hans-Jörg Kreowski, and Clemens Lautemann. A comparison of compatible, finite, and inductive graph properties. Theoretical Computer Science, 110:145-168, 1993.

[HKT93]

Annegret Habel, Hans-Jörg Kreowski, and Stefan Taubenberger. Collages and patterns generated by hyperedge replacement. Languages of Design, 1:125-145, 1993.

[EHK92]

Hartmut Ehrig, Annegret Habel, and Hans-Jörg Kreowski. Introduction to graph grammars with applications to semantic networks. Computers & Mathematics with Applications, 23 (6-9):557-572, 1992.

[Hab92a]

Annegret Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1992.

[Hab92b]

Annegret Habel. Hypergraph grammars: Transformational and algorithmic aspects. Journal of Information Processing and Cybernetics EIK, 28:241-277, 1992.

[EHKP91a]

Hartmut Ehrig, Annegret Habel, Hans-Jörg Kreowski, and Francesco Parisi-Presicce. From graph grammars to high level replacement systems. In Graph Grammars and Their Application to Computer Science, volume 532 of Lecture Notes in Computer Science, pages 269-291. Springer-Verlag, 1991.

[EHKP91b]

Hartmut Ehrig, Annegret Habel, Hans-Jörg Kreowski, and Francesco Parisi-Presicce. Parallelism and concurrency in high level replacement systems. Mathematical Structures in Computer Science, 1:361-404, 1991.

[HK91]

Annegret Habel and Hans-Jörg Kreowski. Collage grammars. In Graph Grammars and Their Application to Computer Science, volume 532 of Lecture Notes in Computer Science, pages 411-429. Springer-Verlag, 1991.

[HKP91]

Annegret Habel, Hans-Jörg Kreowski, and Detlef Plump. Jungle evaluation. Fundamenta Informaticae, XV:37-60, 1991.

[HKV91]

Annegret Habel, Hans-Jörg Kreowski, and Walter Vogler. Decidable boundedness problems for sets of graphs generated by hyperedge replacement. Theoretical Computer Science, 89:33-62, 1991.

[HK90]

Annegret Habel and Hans-Jörg Kreowski. Filtering hyperedge-replacement languages through compatible properties. In Graph-Theoretic Concepts in Computer Science, volume 411 of Lecture Notes in Computer Science, pages 107-120. Springer-Verlag, 1990.

[Hab89a]

Annegret Habel. Graph-theoretic properties compatible with graph derivations. In J. van Leeuwen, editor, Graph-Theoretic Concepts in Computer Science, volume 344 of Lecture Notes in Computer Science, pages 11-29. Springer-Verlag, 1989.

[Hab89b]

Annegret Habel. Hyperedge Replacement: Grammars and Languages. PhD thesis, Universität Bremen, 1989.

[HKV89b]

Annegret Habel, Hans-Jörg Kreowski, and Walter Vogler. Metatheorems for decision problems on hyperedge replacement graph languages. Acta Informatica, 26:657-677, 1989.

[HKV89a]

Annegret Habel, Hans-Jörg Kreowski, and Walter Vogler. Decidable boundedness problems for hyperedge-replacement graph grammars. In J. Diaz and F. Orejas, editors, TAPSOFT '89, volume 351 of Lecture Notes in Computer Science, pages 275-289. Springer-Verlag, 1989.

[HK88]

Annegret Habel and Hans-Jörg Kreowski. Pretty patterns produced by hyperedge replacement. In Graph-Theoretic Concepts in Computer Science, volume 314 of Lecture Notes in Computer Science, pages 32-45. Springer-Verlag, 1988.

[HKP88]

Annegret Habel, Hans-Jörg Kreowski, and Detlef Plump. Jungle evaluation. In D. Sannella and A. Tarlecki, editors, Recent Trends in Data Type Specification, volume 332 of Lecture Notes in Computer Science, pages 92-112. Springer-Verlag, 1988.

[BFH87]

Paul Boehm, Harald-Reto Fonio, and Annegret Habel. Amalgamation of graph transformations: A synchronization mechanism. Journal of Computer and System Sciences, 34:377-408, 1987.

[HK87a]

Annegret Habel and Hans-Jörg Kreowski. Characteristics of graph languages generated by edge replacement. Theoretical Computer Science, 51:81-115, 1987.

[HK87b]

Annegret Habel and Hans-Jörg Kreowski. May we introduce to you: Hyperedge replacement. In H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, editors, Graph Grammars and Their Application to Computer Science, volume 291 of Lecture Notes in Computer Science, pages 15-26. Springer-Verlag, 1987.

[HK87c]

Annegret Habel and Hans-Jörg Kreowski. Some structural aspects of hypergraph languages generated by hyperedge replacement. In F. Brandenburg, G. Vidal-Naquet, and M. Wirsing, editors, STACS 87, volume 247 of Lecture Notes in Computer Science, pages 207-219. Springer-Verlag, 1987.

[HKV87]

Annegret Habel, Hans-Jörg Kreowski, and Walter Vogler. Compatible graph properties are decidable for hyperedge replacement graph languages. Bull. EATCS, volume 33, pages 55-62, 1987.

[EH86]

Hartmut Ehrig and Annegret Habel. Graph grammars with application conditions. In G. Rozenberg and A. Salomaa, editors, The Book of L, pages 87-100, Berlin, 1986. Springer-Verlag.

[EHHB86]

Hartmut Ehrig, Annegret Habel, Udo Hummert, and Paul Boehm. A junction between algebraic specificationas and graph grammmars. Bull. EATCS, volume 29, pages 22-27, 1986.

[EHR86]

Hartmut Ehrig, Annegret Habel, and Barry K. Rosen. Concurrent transformations of relational structures. Fundamenta Informaticae, IX:13-50, 1986.

[BFH85]

Paul Boehm, Harald-Reto Fonio, and Annegret Habel. Amalgamation of graph transformations: A synchronization mechanism. In H. Ehrig, C. Floyd, M. Nivat, and J. Thatcher, editors, Mathematical Foundations of Software Development, volume 185 of Lecture Notes in Computer Science, pages 267-283. Springer-Verlag, 1985.

[EH83]

Hartmut Ehrig and Annegret Habel. Concurrent transformations of graphs and relational structures. In Graph-Theoretic Concepts in Computer Science, pages 76-88. Trauner Verlag, Linz, 1983.

[HK83]

Annegret Habel and Hans-Jörg Kreowski. On context-free graph languages generated by edge replacement. In Graph Grammars and Their Application to Computer Science, volume 153 of Lecture Notes in Computer Science, pages 143-158. Springer-Verlag, 1983.

[Hab80]

Annegret Habel. Concurrency in Graph-Grammatiken. Technical Report 80-11, Technische Universität Berlin, 1980.