Formal Languages

Publications

 

go next top of page

1 Books and monographs

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

 

go next top of page go back

2 Edited Books, Journal Issues and Proceedings

[EHM13]
Rachid Echahed, Annegret Habel, and Mohamed Mosbah, editors. Graph Computation Models 2012, volume 61 of Electronic Communications of the EASST, 2013. [ http ]
[EHM11]
Rachid Echahed, Annegret Habel, and Mohamed Mosbah, editors. Graph Computation Models 2010, volume 39 of Electronic Communications of the EASST, 2011. [ http ]
[DHHP10]
Frank Drewes, Annegret Habel, Berthold Hoffmann, and Detlef Plump, editors. Manipulation of Graphs, Algebras and Pictures: Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday, volume 26 of Electronic Communications of the EASST, 2010. [ http ]
[HM08]
Annegret Habel and Mohamed Mosbah, editors. Proc. Second Int. Workshop on Graph Computation Models (GCM 2008), 52 pages, Leichester, United Kingdom, September, 2008. [ .pdf ]

 

go next top of page go back

3 Journal publications

[EGH+14]
Hartmut Ehrig, Ulrike Golas, Annegret Habel, Leen Lambers, and Fernando Orejas. M-adhesive transformation systems with nested application conditions. Part 1: Parallelism, concurrency and amalgamation. Mathematical Structures in Computer Science, 24(4), 2014. Link. [ .pdf ]
[Fli13]
Nils Erik Flick. Derivation languages of graph grammars. Electronic Communications of the EASST, 61, 2013.
[Rad13]
Hendrik Radke. HR* graph conditions between counting monadic second-order and second-order graph formulas. Electronic Communications of the EASST, 61, 2013. Link.
[Tae12]
Gabriele Taentzer. Instance generation from type graphs with arbitrary multiplicities. Electronic Communications of the EASST, 47, 2012.
[EGH+12]
Hartmut Ehrig, Ulrike Golas, Annegret Habel, Leen Lambers, and Fernando Orejas. M-adhesive transformation systems with nested application conditions. Part 2: Embedding, critical pairs and local confluence. Fundamenta Informaticae, 118:35-63, 2012. [ .pdf ]
[GHE14]
Ulrike Golas, Annegret Habel, and Hartmut Ehrig. Multi-amalgamation of rules with application conditions in M-adhesive categories. Mathematical Structures in Computer Science, 24(4), 2014. Link. [ .pdf ]
[EHL10]
Hartmut Ehrig, Annegret Habel, and Leen Lambers. Parallelism and concurrency theorems for rules with nested application conditions. Electronic Communications of the EASST, 26(Manipulation of Graphs, Algebras and Pictures: Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday), 2010. ECEASST-Link. [ .pdf ]
[HR10]
Annegret Habel and Hendrik Radke. Expressiveness of graph conditions with variables. Electronic Communications of the EASST, 30(Int. Colloquium on Graph and Model Transformation on the occasion of the 65th birthday of Hartmut Ehrig), 2010. ECEASST-Link. [ .pdf ]
[HP09]
Annegret Habel and Karl-Heinz Pennemann. Correctness of high-level transformation systems relative to nested conditions. Mathematical Structures in Computer Science, 19:1-52, 2009. MSCS-Link. [ .pdf ]
[BLM08]
Giorgio Busatto, Markus Lohrey, and Sebastian Maneth. Efficient memory representation of XML document trees. Information Systems, 33 (4-5):456-474, 2008. [ .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(1):135-166, 2006. [ .ps.gz ]
[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 ]
[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.
[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.
[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.
[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.
[Hab92]
Annegret Habel. Hypergraph grammars: Transformational and algorithmic aspects. Journal of Information Processing and Cybernetics EIK, 28:241-277, 1992.
[EHKP91]
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.
[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.
[HKV89]
Annegret Habel, Hans-Jörg Kreowski, and Walter Vogler. Metatheorems for decision problems on hyperedge replacement graph languages. Acta Informatica, 26:657-677, 1989.
[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.
[HK87]
Annegret Habel and Hans-Jörg Kreowski. Characteristics of graph languages generated by edge replacement. Theoretical Computer Science, 51:81-115, 1987.
[EHR86]
Hartmut Ehrig, Annegret Habel, and Barry K. Rosen. Concurrent transformations of relational structures. Fundamenta Informaticae, IX:13-50, 1986.

 

go next top of page go back

4 Inproceedings & Incollections

[PH15]
Christoph Peuser and Annegret Habel. Attribution of graphs by composition of M,N-adhesive categories. In Graph Computation Models (GCM 2015), pages 66-81, 2015. [ .pdf ]
[RAB+15]
Hendrik Radke, Thorsten Arendt, Jan Steffen Becker, Annegret Habel, and Grabriele Taentzer. Translating essential ocl invariants to nested graph constraints focusing on set operations. In Graph Transformations (ICGT 2015), Lecture Notes in Computer Science, 2015. [ long version ].
[AHRT14]
Thorsten Arendt, Annegret Habel, Hendrik Radke, and Gabriele Taentzer. From core OCL invariants to nested graph constraints. In Graph Transformations (ICGT 2014), Lecture Notes in Computer Science, 2014. [ .pdf ] [ long version ] [ Springer Link ].
[FK12a]
Nils Erik Flick and Manfred Kudlek. A hierarchy of languages with catenation and shuffle. In Concurrency, Specification and Programming (CS&P), pages 103-114, 2012.
[FK12b]
Nils Erik Flick and Manfred Kudlek. Language operators for multiset languages and modal logic. In Non-Classical Models for Automata and Applications (NCMA), pages 79-91, 2012.
[FK12c]
Nils Erik Flick and Manfred Kudlek. On a hierarchy of languages with catenation and shuffle. In Developments in Language Theory, pages 452-458, 2012.
[FK12d]
Nils Erik Flick and Manfred Kudlek. Properties of languages with catenation and shuffle. In Concurrency, Specification and Programming (CS&P), pages 91-102, 2012.
[HP12]
Annegret Habel and Detlef Plump. M,N-adhesive transformation systems. In Proc. International Conference on Graph Transformation (ICGT 2012), volume 7562 of Lecture Notes in Computer Science, pages 218-233, 2012. Download Long version. [ .pdf ]
[KPG+11]
Jens Kamenik, Christoph Peuser, Volker Gollücke, Daniel Lorenz, Roland Piechocki, Merlin Wasmann, and Oliver Theel. ZeDDS-Fault-Tolerant Data Management in Wireless Sensor Networks with Mobile Users. In UBICOMM 2011, The Fifth International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies, pages 11-16, 2011.
[GEH10]
Ulrike Golas, Hartmut Ehrig, and Annegret Habel. Multi-amalgamation in adhesive categories. In Graph Transformations (ICGT'10), volume 6372 of Lecture Notes in Computer Science, pages 346-361, 2010. SpringerLink. [ .pdf ]
[EHL+10]
Hartmut Ehrig, Annegret Habel, Leen Lambers, Fernando Orejas, and Ulrike Golas. Local confluence for rules with nested application conditions. In Graph Transformations (ICGT'10), volume 6372 of Lecture Notes in Computer Science, pages 330-345, 2010. SpringerLink. [ .pdf ]
[Rad10b]
Hendrik Radke. Weakest liberal preconditions relative to HR* graph conditions. In 3rd Int. Workshop on Graph Computation Models (GCM 2010), Preproceedings, pages 165-178, 2010. ISSN 0929-0672. [ .pdf ]
[Rad10a]
Hendrik Radke. Correctness of graph programs relative to HR+ conditions. In Graph Transformations (ICGT 2010), Doctoral Symposium, volume 6372 of Lecture Notes in Computer Science, pages 410-412, 2010. SpringerLink. [ .pdf ]
[Aza08]
Karl Azab. Editing nested constraints and application conditions. In A. Habel and M. Mosbah, editors, Proc. Int. Workshop on Graph Computation Models (GCM'08), pages 35-42, 2008. Download Long version. [ .pdf ]
[Pen08c]
Karl-Heinz Pennemann. Resolution-like theorem proving for high-level conditions. In Graph Transformations (ICGT'08), volume 5214 of Lecture Notes in Computer Science, pages 289-304. Springer-Verlag, 2008. SpringerLink. [ .pdf ]
[Pen08b]
Karl-Heinz Pennemann. Development of correct graph transformation systems - Preliminary abstract. In Graph Transformations (ICGT'08 Doctoral Symposium), volume 5214 of Lecture Notes in Computer Science, pages 508-510. Springer-Verlag, 2008. SpringerLink. [ .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. SpringerLink. [ .pdf ]
[AP08]
Karl Azab and Karl-Heinz Pennemann. Type checking C++ template instantiation by graph programs. In Proc. Int. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'08), volume 10, pages 249-262. Electronic Communications of the EASST, 2008. ECEASST-Link. [ .pdf ]
[Pen08a]
Karl-Heinz Pennemann. An algorithm for approximating the satisfiability problem of high-level conditions. In Proc. Graph Transformation for Verification and Concurrency (GT-VC'07), volume 213 of Electronic Notes in Theoretical Computer Science, pages 75-94. Elsevier, 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 the EASST, 2007. ECEASST-Link. [ .pdf ]
[HPR06]
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. SpringerLink. [ .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. SpringerLink. [ .pdf ]
[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. SpringerLink. [ .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. SpringerLink. [ .ps.gz ]
[BLM05]
Giorgio Busatto, Markus Lohrey, and Sebastian Maneth. Efficient memory representation of XML documents. In 10th International Symposium on Database Programming Languages (DBPL05), volume 3774 of Lecture Notes in Computer Science, pages 199-216. Springer-Verlag, 2005. SpringerLink.
[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. SpringerLink. [ .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. SpringerLink. [ .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. SpringerLink. [ .ps.gz ]
[MB04]
Sebastian Maneth and Giorgio Busatto. Tree transducers and tree compressions. In Proc. Foundations of Software Science and Computation Structures (FOSSACS 2004), volume 2987 of Lecture Notes in Computer Science, pages 363-377. Springer-Verlag, 2004. SpringerLink.
[Obe03]
Jürgen Obermeyer. BlueJ - eine didaktische Java-Entwicklungsumgebung. In Andreas Schwill, editor, Grundfragen multimedialer Lehre, Tagungsband des 1. Workshops GML2003, pages 174-178, 2003. [ .pdf ]
[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. SpringerLink. [ .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.
[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. SpringerLink. [ .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. SpringerLink.
[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. SpringerLink.
[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. SpringerLink.
[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. SpringerLink. [ .ps.gz ]
[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.
[EHKP91]
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.
[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. SpringerLink.
[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. SpringerLink.
[Hab89]
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. SpringerLink.
[HKV89]
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. SpringerLink.
[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. SpringerLink.
[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. SpringerLink.
[HK87a]
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. SpringerLink.
[HK87b]
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. SpringerLink.
[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.
[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. SpringerLink.

 

go next top of page go back

5 Further publications

[PH15]
Christoph Peuser and Annegret Habel. Attribution of graphs by composition of M,N-adhesive categories: long version, 2015. [ .pdf ]
[Peu13]
Christoph Peuser. Attribution concepts for graph transformation. Master's thesis, Carl von Ossietzky Universität Oldenburg, 2013. [ .pdf ]
[Ell09]
Christian Ellen. Enforcer - Ein Editor für Graphspezifikationen. Diplomarbeit, 96 Seiten, Universität Oldenburg, 2009. [ .pdf ]
[Pen09]
Karl-Heinz Pennemann. Development of Correct Graph Transformation Systems. PhD thesis, Department für Informatik, Universität Oldenburg, Oldenburg, 2009. Electronic Dissertation. [ .pdf ]
[Ble08]
Christian Bley. Ein Editor zum Erstellen von Graphprogrammen. Technical report, 2008. [ .pdf ]
[MH08]
Mohamed Mosbah and Annegret Habel. Workshop on graph computation models, 2008. SpringerLink. [ .pdf ]
[AP07]
Karl Azab and Karl-Heinz Pennemann. Type checking C++ template instantiation by graph programs. Berichte aus dem Department für Informatik 04/07, 24 pages, Universität Oldenburg, 2007. [ .pdf ]
[Zuc06]
Christian Zuckschwerdt. Ein System zur Transformation von Konsistenz in Anwendungsbedingungen. Berichte aus dem Department für Informatik 11/06, 114 pages, Universität Oldenburg, 2006. [ .pdf ]
[HPR06]
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 ]
[BLM04]
Giorgio Busatto, Markus Lohrey, and Sebastian Maneth. Grammar-based tree compression. Report IC/2004/80, School of Computer and Communication Sciences, Swiss Federal Institute of Technology, Lausanne, 2004. [ http ]
[Bus04]
Giorgio Busatto. GraJ: A system for executing graph programs in Java. Berichte aus dem Fachbereich Informatik 3/04, Universität Oldenburg, 2004. [ .ps.gz ]
[Oeh04]
Jens Oehlerking. Transformation of Edmonds' maximum matching algorithm into a graph program. Berichte aus dem Fachbereich Informatik 1/04, Universität Oldenburg, 2004. [ .ps.gz ]
[Pen04]
Karl-Heinz Pennemann. Generalized constraints and application conditions for graph transformation systems. Master's thesis, Dept. of Computing Science, University of Oldenburg, Oldenburg, 2004. [ .pdf ]
[Ste03]
Sandra Steinert. Graph programs for graph algorithms. Berichte aus dem Fachbereich Informatik 7/03, Universität Oldenburg, 2003. [ .ps.gz ]
[Möl03]
Andreas Möller. Eine virtuelle Maschine für Graphprogramme. Berichte aus dem Fachbereich Informatik 5/03, Universität Oldenburg, 2003. [ .ps.gz ]
[Bus02]
Giorgio Busatto. Dissertation: An abstract model of hierarchical graphs and hierarchical graph transformation. Berichte aus dem Fachbereich Informatik 3/02 - Oktober 02, Universität Oldenburg, 2002.
[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.
[Hab89]
Annegret Habel. Hyperedge Replacement: Grammars and Languages. PhD thesis, Universität Bremen, 1989.
[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.
[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.
[Hab80]
Annegret Habel. Concurrency in Graph-Grammatiken. Technical Report 80-11, Technische Universität Berlin, 1980.
 top of page go back