Formale Sprachen

Prof. Dr. Annegret Habel

Anschrift: Prof. Dr. Annegret Habel
Universität Oldenburg
Fakultät II
Department für Informatik
26111 Oldenburg
Raum: A2 2-205
Telefon: (04 41) 798-2998
Fax: (04 41) 798-2965
Sprechstunde: Nach Vereinbarung
E-Mail: Annegret.Habel

Forschung

Allgemeine Graphtransformation
Korrekte Graphtransformationssysteme

Mitgliedschaften in Programmkomitees

Konferenzen:

Workshops:

  • C. Peuser und A. Habel, "Composition of M,N-Adhesive Categories with Application to Attribution of Graphs," Electronic Communications of the EASST, vol. 73, 2016.
    @article{Peuser-Habel16a,
      author = {Christoph Peuser and Annegret Habel},
      title = {Composition of M,N-Adhesive Categories with Application to Attribution of Graphs},
      booktitle = {Graph Computation Models, Selected Revised Papers from GCM 2015},
      journal = {Electronic Communications of the EASST},
      volume = {73},
      pages = {},
      year = {2016},
      publists = {mmgg},
      url = {http://journal.ub.tu-berlin.de/eceasst/article/view/1035} }
  • H. Radke, T. Arendt, J. S. Becker, A. Habel, und G. Taentzer, Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations: Long version, 2016.
    @misc{RAB+16Long,
      author = {Hendrik Radke and Thorsten Arendt and Jan Steffen Becker and Annegret Habel and Grabriele Taentzer},
      title = {{Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations: Long version}},
      url = {http://www.uni-marburg.de/fb12/forschung/berichte/berichteinformtk/pdfbi/bi2016-01.pdf},
      year = {2016},
      publists = {mmgg} }
  • [proceedings] bibtex
    Graph Computation Models. Selected Revised Papers from GCM 2014, 2015.
    @proceedings{Echahed-Habel-Mosbah15a, editor = {Echahed, Rachid and Habel, Annegret and Mosbah, Mohamed},
      title = {Graph Computation Models. Selected Revised Papers from GCM 2014},
      journal = {Electronic Communications of the EASST},
      volume = {71},
      year = {2015} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    C. Peuser und A. Habel, "Attribution of Graphs by Composition of M,N-adhesive Categories," in Proc. Graph Computation Models (GCM 2015), 2015, pp. 66-81.
    @inproceedings{Peuser-Habel15a,
      author = {Christoph Peuser and Annegret Habel},
      title = {Attribution of Graphs by Composition of M,N-adhesive Categories},
      booktitle = {Graph Computation Models (GCM 2015)},
      publisher = {CEUR-WS.org},
      volume = {1403},
      pages = {66--81},
      year = {2015},
      url = {http://ceur-ws.org/Vol-1403/paper6.pdf} }
  • C. Peuser und A. Habel, Attribution of graphs by composition of M,N-adhesive categories: long version, 2015.
    @misc{Peuser-Habel15b,
      author = {Christoph Peuser and Annegret Habel},
      title = {Attribution of graphs by composition of {M},
     {N}-adhesive categories: long version},
      year = {2015},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/PH15_mn-composition_long.pdf} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    H. Radke, T. Arendt, J. S. Becker, A. Habel, und G. Taentzer, "Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations," in Proc. Graph Transformations (ICGT 2015), 2015, pp. 155-170.
    @inproceedings{Radke+15a,
      author = {Hendrik Radke and Thorsten Arendt and Jan Steffen Becker and Annegret Habel and Grabriele Taentzer},
      title = {Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations},
      booktitle = {Graph Transformations (ICGT 2015)},
      series = {Lecture Notes in Computer Science},
      volume = {9151},
      pages = {155--170},
      year = {2015},
      url = {http://www.uni-marburg.de/fb12/forschung/berichte/berichteinformtk/pdfbi/bi2015-01.pdf},
      publists = {mmgg} }
  • H. Ehrig, U. Golas, A. Habel, L. Lambers, und F. Orejas, "M-Adhesive Transformation Systems with Nested Application Conditions. Part 1: Parallelism, Concurrency and Amalgamation," Mathematical Structures in Computer Science, vol. 24(4), 2014.
    @article{Ehrig-Golas-Habel-Lambers-Orejas14a,
      author = {Ehrig, Hartmut and Golas, Ulrike and Habel, Annegret and Lambers, Leen and Orejas, Fernando},
      title = {{M}-Adhesive Transformation Systems with Nested Application Conditions. {P}art 1: Parallelism, Concurrency and Amalgamation},
      journal = {Mathematical Structures in Computer Science},
      volume = {24(4)},
      pages = {},
      year = {2014},
      url = {http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=9293027&fulltextType=RA&fileId=S0960129512000357},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/EGHLO12-1-parallelism.pdf} }
  • U. Golas, A. Habel, und H. Ehrig, "Multi-Amalgamation of Rules with Application Conditions in M-Adhesive Categories," Mathematical Structures in Computer Science, vol. 24(4), 2014.
    @article{Golas-Habel-Ehrig14a,
      author = {Golas, Ulrike and Habel, Annegret and Ehrig, Hartmut },
      title = {Multi-Amalgamation of Rules with Application Conditions in {M}-Adhesive Categories},
      journal = {Mathematical Structures in Computer Science},
      volume = {24(4)},
      year = {2014},
      url = {http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=9292997&fulltextType=RA&fileId=S0960129512000345},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/GHE12.pdf} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    T. Arendt, A. Habel, H. Radke, und G. Taentzer, "From Core OCL Invariants to Nested Graph Constraints," in Proc. Graph Transformations (ICGT 2014), 2014, pp. 97-112.
    @inproceedings{Arendt-Habel-Radke-Taentzer14a,
      author = {Thorsten Arendt and Annegret Habel and Hendrik Radke and Gabriele Taentzer},
      title = {From Core {OCL} Invariants to Nested Graph Constraints},
      booktitle = {Graph Transformations (ICGT 2014)},
      series = {Lecture Notes in Computer Science},
      volume = {8571},
      pages = {97--112},
      year = {2014},
      opturl = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/AHRT14a.pdf},
      url = {http://link.springer.com/chapter/10.1007/978-3-319-09108-2_7},
      publists = {mmgg} }
  • [proceedings] bibtex | Dokument aufrufen Dokument aufrufen
    Graph Computation Models 2012, 2013.
    @proceedings{Echahed-Habel-Mosbah13a, editor = {Echahed, Rachid and Habel, Annegret and Mosbah, Mohamed},
      title = {Graph Computation Models 2012},
      series = {Electronic Communications of the EASST},
      volume = {61},
      year = {2013},
      url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/view/69} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel und D. Plump, "M,N-adhesive transformation systems," in Proc. Proc. International Conference on Graph Transformation (ICGT 2012), 2012, pp. 218-233.
    @inproceedings{Habel-Plump12a,
      author = {Habel, Annegret and Plump, Detlef},
      title = {{M},
     {N}-adhesive transformation systems},
      booktitle = {Proc. International Conference on Graph Transformation (ICGT 2012)},
      series = {Lecture Notes in Computer Science},
      volume = {7562},
      pages = {218--233},
      year = {2012},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/HaPl12b.pdf},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/HaPl12a.pdf} }
  • H. Ehrig, U. Golas, A. Habel, L. Lambers, und F. Orejas, "M-Adhesive Transformation Systems with Nested Application Conditions. Part 2: Embedding, Critical Pairs and Local Confluence," Fundamenta Informaticae, vol. 118, pp. 35-63, 2012.
    @article{Ehrig-Golas-Habel-Lambers-Orejas12a,
      author = {Ehrig, Hartmut and Golas, Ulrike and Habel, Annegret and Lambers, Leen and Orejas, Fernando},
      title = {{M}-Adhesive Transformation Systems with Nested Application Conditions. {P}art 2: Embedding, Critical Pairs and Local Confluence},
      journal = {Fundamenta Informaticae},
      volume = {118},
      pages = {35--63},
      year = {2012},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/EGHLO12-2-embedding.pdf} }
  • [proceedings] bibtex
    Graph Computation Models 2010, 2011.
    @proceedings{Echahed-Habel-Mosbah11a, editor = {Echahed, Rachid and Habel, Annegret and Mosbah, Mohamed},
      title = {Graph Computation Models 2010},
      journal = {Electronic Communications of the EASST},
      volume = {39},
      year = {2011} }
  • [proceedings] bibtex | Dokument aufrufen Dokument aufrufen
    Graph Computation Models, Proc. Third International Workshop, GCM 2010, Twente, The Netherlands, October, 2010.
    @proceedings{Echahed-Habel-Mosbah10a, editor = {Echahed, Rachid and Habel, Annegret and Mosbah, Mohamed},
      title = {Graph Computation Models, Proc. Third International Workshop, GCM 2010, Twente, The Netherlands, October},
      year = {2010},
      note = {ISSN 09029-0672},
      url = {http://gcm2010.imag.fr/} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    H. Ehrig, A. Habel, und L. Lambers, "Parallelism and Concurrency Theorems for Rules with Nested Application Conditions," in Proc. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday, 2010.
    @inproceedings{Ehrig-Habel-Lambers10a,
      author = {Ehrig, Hartmut and Habel, Annegret and Lambers, Leen},
      title = {Parallelism and Concurrency Theorems for Rules with Nested Application Conditions},
      editors = {Drewes, Frank, Habel, Annegret and Hoffmann, Berthold and Plump, Detlef},
      booktitle = {Essays Dedicated to Hans-J\"org Kreowski on the Occasion of His 60th Birthday},
      series = {Electronic Communications of the EASST},
      volume = {26},
      year = {2010},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/EHL10.pdf} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    U. Golas, H. Ehrig, und A. Habel, "Multi-Amalgamation in Adhesive Categories," in Proc. Graph Transformations (ICGT'10), 2010, pp. 346-361.
    @inproceedings{Golas-Ehrig-Habel10a,
      author = {Golas, Ulrike and Ehrig, Hartmut and Habel, Annegret},
      title = {Multi-Amalgamation in Adhesive Categories},
      booktitle = {Graph Transformations (ICGT'10)},
      series = {Lecture Notes in Computer Science},
      volume = {6372},
      pages = {346-361},
      year = {2010},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/GEH10.pdf},
      url = {http://springerlink.metapress.com/content/f0620787335n3670/} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    H. Ehrig, A. Habel, L. Lambers, F. Orejas, und U. Golas, "Local Confluence for Rules with Nested Application Conditions," in Proc. Graph Transformations (ICGT'10), 2010, pp. 330-345.
    @inproceedings{Ehrig-Habel-Lambers-Orejas-Golas10a,
      author = {Ehrig, Hartmut and Habel, Annegret and Lambers, Leen and Orejas, Fernando and Golas, Ulrike},
      title = {Local Confluence for Rules with Nested Application Conditions},
      booktitle = {Graph Transformations (ICGT'10)},
      series = {Lecture Notes in Computer Science},
      volume = {6372},
      pages = {330-345},
      year = {2010},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/EHLOG10.pdf},
      url = {http://springerlink.metapress.com/content/x273147851566804/} }
  • [proceedings] bibtex | Dokument aufrufen Dokument aufrufen
    Manipulation of Graphs, Algebras and Pictures: Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday, 2010.
    @proceedings{Drewes-Habel-Hoffmann-Plump10a, editor = {Drewes, Frank and Habel, Annegret and Hoffmann, Berthold and Plump, Detlef},
      title = {{Manipulation of Graphs, Algebras and Pictures: Essays Dedicated to Hans-J\"org Kreowski on the Occasion of His 60th Birthday}},
      series = {Electronic Communications of the EASST},
      volume = {26},
      year = {2010},
      url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/view/36} }
  • A. Habel und H. Radke, "Expressiveness of Graph Conditions with Variables," Electronic Communications of the EASST, vol. 30, iss. \emphInt. Colloquium on Graph and Model Transformation on the occasion of the 65th birthday of Hartmut Ehrig, 2010.
    @article{Habel-Radke10a,
      author = {Habel, Annegret and Radke, Hendrik},
      title = {Expressiveness of Graph Conditions with Variables},
      number = {\emph{Int. Colloquium on Graph and Model Transformation on the occasion of the 65th birthday of {H}artmut {E}hrig}},
      journal = {Electronic Communications of the EASST},
      volume = {30},
      year = {2010},
      publists = {topics},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/HaRa10a.pdf},
      url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/view/40} }
  • [misc] bibtex
    F. Drewes, A. Habel, B. Hoffmann, und D. Plump, Manipulation of Graphs, Algebras and Pictures: Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th BirthdayUniversität Bremen, 362 pages, 2009.
    @misc{Drewes-Habel-Hoffmann-Plump09a,
      author = {Drewes, Frank and Habel, Annegret and Hoffmann, Berthold and Plump, Detlef},
      title = {Manipulation of Graphs, Algebras and Pictures: Essays Dedicated to Hans-J\"org Kreowski on the Occasion of His 60th Birthday},
      booktitle = {},
      publisher = {Universit\"at Bremen, 362 pages},
      series = {},
      volume = {},
      pages = {},
      year = {2009} }
  • A. Habel und K. Pennemann, "Correctness of high-level transformation systems relative to nested conditions," Mathematical Structures in Computer Science, vol. 19, pp. 1-52, 2009.
    @article{Habel-Pennemann09a,
      author = {Habel, Annegret and Pennemann, Karl-Heinz},
      title = {Correctness of high-level transformation systems relative to nested conditions},
      journal = {Mathematical Structures in Computer Science},
      volume = {19},
      pages = {1-52},
      year = {2009},
      publists = {dcgts,selected,topics},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/mscs-HP09.pdf},
      url = {http://journals.cambridge.org/action/displayFulltext?type=1&fid=5376264&jid=MSC&volumeId=19&issueId=02&aid=5376256} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    K. Azab, "Editing Nested Constraints and Application Conditions," in Proc. Proc. Int. Workshop on Graph Computation Models (GCM'08), 2008, pp. 35-42.
    @inproceedings{Azab08a,
      author = {Azab, Karl},
      title = {Editing Nested Constraints and Application Conditions},
      booktitle = {Proc. Int. Workshop on Graph Computation Models (GCM'08)},
      editor = {Habel, A. and Mosbah, M.},
      year = {2008},
      publists = {dcgts},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/editing_gcm.pdf},
      pages = {35-42},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/editing_long.pdf} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    K. Azab und A. Habel, "High-level programs and program conditions," in Proc. Graph Transformations (ICGT'08), 2008, pp. 211-225.
    @inproceedings{Azab-Habel08a,
      author = {Azab, Karl and Habel, Annegret},
      title = {High-level programs and program conditions},
      booktitle = {Graph Transformations (ICGT'08)},
      year = {2008},
      series = {Lecture Notes in Computer Science},
      volume = {5214},
      pages = {211-225},
      publisher = {Springer-Verlag},
      publists = {dcgts},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/program-conditions.pdf},
      url = {http://springerlink.metapress.com/content/v0w814m5125603h2/} }
  • [proceedings] bibtex | Dokument aufrufen Dokument aufrufen
    Proc. Second Int. Workshop on Graph Computation Models (GCM 2008), 52 pages, Leichester, United Kingdom, September, 2008.
    @proceedings{Habel-Mosbah08a, editor = {Habel, Annegret and Mosbah, Mohamed},
      title = {Proc. Second Int. Workshop on Graph Computation Models (GCM 2008), 52 pages, Leichester, United Kingdom, September},
      publisher = {},
      year = {2008},
      publists = {dcgts},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/gcm-proceedings-v.1.0.pdf} }
  • M. Mosbah und A. Habel, Workshop on Graph Computation ModelsSpringer, 2008.
    @misc{Mosbah-Habel08a,
      author = {Mosbah, Mohamed and Habel, Annegret},
      title = {Workshop on Graph Computation Models},
      booktitle = {Graph Transformations (ICGT 2008)},
      publisher = {Springer},
      series = {Lecture Notes in Computer Science},
      volume = {5214},
      pages = {460-462},
      year = {2008},
      publists = {dcgts},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/gcm2008.pdf},
      url = {http://springerlink.metapress.com/content/u16670u615359414/} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    K. Azab, A. Habel, K. Pennemann, und C. Zuckschwerdt, "ENFORCe: A System for Ensuring Formal Correctness of High-level Programs," in Proc. Proc. 3rd International Workshop on Graph Based Tools (GraBaTs'06), 2007, pp. 82-93.
    @inproceedings{Azab-Habel-Pennemann-Zuckschwerdt06a,
      author = {Azab, Karl and Habel, Annegret and Pennemann, Karl-Heinz and Zuckschwerdt, Christian},
      title = {{ENFORCe}: A System for Ensuring Formal Correctness of High-level Programs},
      booktitle = {Proc. 3rd International Workshop on Graph Based Tools (GraBaTs'06)},
      year = {2007},
      volume = {1},
      publisher = {Electronic Communications of the EASST},
      pages = {82-93},
      issn = {1863-2122},
      publists = {dcgts},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/enforce.pdf},
      url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/view/9} }
  • H. Ehrig, A. Habel, J. Padberg, und U. Prange, "Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation," Fundamenta Informaticae, vol. 74, pp. 1-29, 2006.
    @article{Ehrig-Habel-Padberg-Prange06a,
      author = {Ehrig, Hartmut and Habel, Annegret and Padberg, Julia and Prange, Ulrike},
      title = {Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation},
      journal = {Fundamenta Informaticae},
      volume = {74},
      pages = {1-29},
      year = {2006},
      publists = {dcgts},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/fundamenta-ahlr.pdf} }
  • A. Habel, K. Pennemann, und A. Rensink, "Weakest Preconditions for High-Level Programs (Long Version)," Universität Oldenburg, Berichte aus dem Department für Informatik 8/06, 35 pages, 2006.
    @techreport{Habel-Pennemann-Rensink06b,
      author = {Habel, Annegret and Pennemann, Karl-Heinz and Rensink, Arend},
      title = {Weakest Preconditions for High-Level Programs (Long Version)},
      type = {{Berichte aus dem Department f\"ur Informatik}},
      number = {8/06, 35 pages},
      institution = {Universit\"at Oldenburg},
      year = {2006},
      issn = {0946-2910},
      publists = {dcgts},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/hpr06-long.pdf} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel, K. Pennemann, und A. Rensink, "Weakest Preconditions for High-Level Programs," in Proc. Graph Transformations (ICGT'06), 2006, pp. 445-460.
    @inproceedings{Habel-Pennemann-Rensink06a,
      author = {Habel, Annegret and Pennemann, Karl-Heinz and Rensink, Arend},
      title = {Weakest Preconditions for High-Level Programs},
      booktitle = {Graph Transformations (ICGT'06)},
      year = {2006},
      series = {Lecture Notes in Computer Science},
      volume = {4178},
      pages = {445-460},
      publisher = {Springer-Verlag},
      publists = {dcgts},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/weakestpreconditions.pdf},
      url = {http://springerlink.metapress.com/content/bj1683345uv61r68/} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel und K. Pennemann, "Satisfiability of High-Level Conditions," in Proc. Graph Transformations (ICGT'06), 2006, pp. 430-444.
    @inproceedings{Habel-Pennemann06b,
      author = {Habel, Annegret and Pennemann, Karl-Heinz},
      title = {Satisfiability of High-Level Conditions},
      booktitle = {Graph Transformations (ICGT'06)},
      year = {2006},
      series = {Lecture Notes in Computer Science},
      volume = {4178},
      pages = {430-444},
      publisher = {Springer-Verlag},
      publists = {dcgts},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/satisfiability.pdf},
      url = {http://www.springerlink.com/content/3h1012651r702875/} }
  • H. Ehrig, K. Ehrig, A. Habel, und K. Pennemann, "Theory of Constraints and Application Conditions: From Graphs to High-Level Structures," Fundamenta Informaticae, vol. 74, iss. 1, pp. 135-166, 2006.
    @article{Ehrig-Ehrig-Habel-Pennemann06a,
      author = {Ehrig, Hartmut and Ehrig, Karsten and Habel, Annegret and Pennemann, Karl-Heinz},
      title = {Theory of Constraints and Application Conditions: From Graphs to High-Level Structures},
      journal = {Fundamenta Informaticae},
      volume = {74},
      number = {1},
      pages = {135-166},
      year = {2006},
      publists = {dcgts,selected},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/fundamenta-constraints.ps.gz} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    R. Reussner, J. Happe, und A. Habel, "Modeling Parametric Component Contracts and the State Space of Composite Components by Graph Grammars," in Proc. Fundamental Approaches to Software Engineering (FASE'05), 2005, pp. 80-95.
    @inproceedings{Reussner-Happe-Habel05a,
      author = {Reussner, Ralf and Happe, Jens and Habel, Annegret},
      title = {Modeling Parametric Component Contracts and the State Space of Composite Components by Graph Grammars},
      booktitle = {Fundamental Approaches to Software Engineering (FASE'05)},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {3442},
      pages = {80-95},
      year = {2005},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/parametric-component-contracts-fase05.pdf},
      url = {http://springerlink.metapress.com/content/x4pxku9n1kdl3crh/} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel und K. Pennemann, "Nested Constraints and Application Conditions for High-Level Structures," in Proc. Formal Methods in Software and System Modeling, 2005, pp. 294-308.
    @inproceedings{Habel-Pennemann05a,
      author = {Habel, Annegret and Pennemann, Karl-Heinz},
      title = {Nested Constraints and Application Conditions for High-Level Structures},
      editor = {Kreowski, Hans-J\"org and Montanari, Ugo and Orejas, Fernando and Rozenberg, Grzegorz and Taentzer, Gabriele},
      booktitle = {Formal Methods in Software and System Modeling},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {3393},
      pages = {294-308},
      year = {2005},
      publists = {dcgts},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/nested-constraints.ps.gz},
      url = {http://springerlink.metapress.com/content/j90uycf5wpey/#section=560146} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    H. Ehrig, A. Habel, J. Padberg, und U. Prange, "Adhesive High-Level Replacement Categories and Systems," in Proc. Graph Transformation (ICGT'04), 2004, pp. 144-160.
    @inproceedings{Ehrig-Habel-Padberg-Prange04a,
      author = {Ehrig, Hartmut and Habel, Annegret and Padberg, Julia and Prange, Ulrike},
      title = {Adhesive High-Level Replacement Categories and Systems},
      booktitle = {Graph Transformation (ICGT'04)},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {3256},
      pages = {144-160},
      year = {2004},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/adhesive-highlevel.pdf},
      url = {http://springerlink.metapress.com/content/trmv85yw196g4h0k/} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel und B. Hoffmann, "Parallel Independence in Hierachical Graph Transformation," in Proc. Graph Transformation (ICGT'04), 2004, pp. 178-193.
    @inproceedings{Habel-Hoffmann04a,
      author = {Habel, Annegret and Hoffmann, Berthold},
      title = {Parallel Independence in Hierachical Graph Transformation},
      booktitle = {Graph Transformation (ICGT'04)},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {3256},
      pages = {178-193},
      year = {2004},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/parallel-independence.ps.gz},
      url = {http://springerlink.metapress.com/content/eu0u23ytntbky921/} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    H. Ehrig, K. Ehrig, A. Habel, und K. Pennemann, "Constraints and Application Conditions: From Graphs to High-Level Structures," in Proc. Graph Transformation (ICGT'04), 2004, pp. 287-303.
    @inproceedings{Ehrig-Ehrig-Habel-Pennemann04a,
      author = {Ehrig, Hartmut and Ehrig, Karsten and Habel, Annegret and Pennemann, Karl-Heinz},
      title = {Constraints and Application Conditions: From Graphs to High-Level Structures},
      booktitle = {Graph Transformation (ICGT'04)},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {3256},
      pages = {287-303},
      year = {2004},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/constraints-applicationconditions.ps.gz},
      url = {http://springerlink.metapress.com/content/tpbacu8vjr0uku6u/} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel und D. Plump, "Relabelling in Graph Transformation," in Proc. Graph Transformation, First International Conference, ICGT 2002, 2002, pp. 135-147.
    @inproceedings{Habel-Plump02c,
      author = {Habel, Annegret and Plump, Detlef},
      title = {Relabelling in Graph Transformation},
      booktitle = {Graph Transformation, First International Conference, ICGT 2002},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {2505},
      pages = {135-147},
      year = {2002},
      url = {http://theoretica.informatik.uni-oldenburg.de/~skript/fs-pub/relabelling-01.10.02.ps.gz},
      url = {http://springerlink.metapress.com/content/wwnljmhhgdk65nt0/} }
  • [inproceedings] bibtex
    A. Habel und D. Plump, "A Core Language for Graph Transformation (Extended Abstract)," in Proc. Proc. Applied Graph Transformation (AGT'2002), 2002, pp. 187-199.
    @inproceedings{Habel-Plump02b,
      author = {Habel, Annegret and Plump, Detlef},
      title = {A Core Language for Graph Transformation (Extended Abstract)},
      editor = {Kreowski, Hans-J\"org and Knirsch, Peter},
      booktitle = {Proc. Applied Graph Transformation (AGT'2002)},
      publisher = {},
      series = {},
      volume = {},
      pages = {187-199},
      year = {2002} }
  • [inproceedings] bibtex
    H. Ehrig, A. Habel, und F. Parisi-Presicce, "Basic Results for Two Types of High-Level Replacement Systems," in Proc. GETGRATS, 2002, p. 12.
    @inproceedings{ehrig-habel-parisi-presicce02a,
      author = {Ehrig, Hartmut and Habel, Annegret and {Parisi-Presicce},
      Francesco},
      title = {Basic Results for Two Types of High-Level Replacement Systems},
      booktitle = {GETGRATS},
      series = {Electronic Notes in Theoretical Computer Science},
      volume = {51},
      pages = {12},
      year = {2002} }
  • [inproceedings] bibtex
    A. Habel und D. Plump, "Solving Equations by Graph Transformation," in Proc. GETGRATS, 2002, p. 12.
    @inproceedings{habel-plump02a,
      author = {Habel, Annegret and Plump, Detlef},
      title = {Solving Equations by Graph Transformation},
      booktitle = {GETGRATS},
      series = {Electronic Notes in Theoretical Computer Science},
      volume = {51},
      pages = {12},
      year = {2002} }
  • A. Habel, J. Müller, und D. Plump, "Double-Pushout Graph Transformation Revisited," Mathematical Structures in Computer Science, vol. 11, iss. 5, pp. 637-688, 2001.
    @article{habel-mueller-plump01a,
      author = {Habel, Annegret and M\"uller, J\"urgen and Plump, Detlef},
      title = {Double-Pushout Graph Transformation Revisited},
      journal = {Mathematical Structures in Computer Science},
      volume = {11},
      number = {5},
      pages = {637-688},
      year = {2001},
      publists = {selected},
      url = {http://theoretica.informatik.uni-oldenburg.de/~skript/fs-pub/mscs-article-DP.ps.gz} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel und D. Plump, "Computational Completeness of Programming Languages Basedon Graph Transformation," in Proc. Proc. Foundations of Software Science and Computation Structures (FOSSACS 2001), 2001, pp. 230-245.
    @inproceedings{habel-plump01a,
      author = {Habel, Annegret and Plump, Detlef},
      title = {Computational Completeness of Programming Languages Basedon Graph Transformation},
      booktitle = {Proc. Foundations of Software Science and Computation Structures (FOSSACS 2001)},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {2030},
      pages = {230-245},
      year = {2001},
      publists = {selected},
      url = {http://theoretica.informatik.uni-oldenburg.de/~skript/fs-pub/article-FOSSACS-18.01.01.ps.gz},
      url = {http://springerlink.metapress.com/content/775341g666687602/} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel, J. Müller, und D. Plump, "Double-Pushout Approach with Injective Matching," in Proc. Theory and Application of Graph Transformations, 2000, pp. 103-116.
    @inproceedings{habel-mueller-plump00a,
      author = {Habel, Annegret and M\"uller, J\"urgen and Plump, Detlef},
      title = {Double-Pushout Approach with Injective Matching},
      booktitle = {Theory and Application of Graph Transformations},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {1764},
      pages = {103-116},
      year = {2000},
      url = {http://springerlink.metapress.com/content/ltw32jh0b1uvj4x9/} }
  • [article] bibtex
    M. Andries, G. Engels, A. Habel, B. Hoffmann, H. Kreowski, S. Kuske, D. Plump, A. Schürr, und G. Taentzer, "Graph Transformation for Specification and Programming," Science of Computer Programming, vol. 34, iss. 1, pp. 1-54, 1999.
    @article{andries-engels-habel+99a,
      author = {Andries, Marc and Engels, Gregor and Habel, Annegret and Hoffmann, Berthold and Kreowski, Hans-J\"org and Kuske, Sabine and Plump, Detlef and Sch\"urr, Andy and Taentzer, Gabriele},
      title = {Graph Transformation for Specification and Programming},
      journal = {Science of Computer Programming},
      volume = {34},
      number = {1},
      pages = {1-54},
      year = {1999} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel und D. Plump, "Complete Strategies for Term Graph Narrowing," in Proc. Recent Trends in Algebraic Development Techniques, Selected Papers, 1999, pp. 152-167.
    @inproceedings{habel-plump99a,
      author = {Habel, Annegret and Plump, Detlef},
      title = {Complete Strategies for Term Graph Narrowing},
      editor = {Fiadeiro, Jose Luiz},
      booktitle = {Recent Trends in Algebraic Development Techniques, Selected Papers},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {1589},
      pages = {152-167},
      year = {1999},
      url = {http://springerlink.metapress.com/content/3agr5wte22vcx4th/} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel und R. Klempien-Hinrichs, "Atom Replacement in Hypergraphs (Extended Abstract)," in Proc. TAGT'98 --- 6th International Worshop on Theory and Application of Graph Transformation, 1998, pp. 182-189.
    @inproceedings{habel-klempien-hinrichs98a,
      author = {Habel, Annegret and {Klempien-Hinrichs},
      Renate},
      title = {Atom Replacement in Hypergraphs (Extended Abstract)},
      editor = {Engels, G. and Rozenberg, G.},
      booktitle = {TAGT'98 --- 6th International Worshop on Theory and Application of Graph Transformation},
      publisher = {Universit\"at-GH Paderborn},
      series = {Bericht tr-ri-98-201, Reihe Informatik},
      pages = {182-189},
      year = {1998},
      url = {http://theoretica.informatik.uni-oldenburg.de/~skript/fs-pub/atom-replacement.ps.gz} }
  • [incollection] bibtex
    F. Drewes, A. Habel, und H. Kreowski, "Hyperedge Replacement Graph Grammars," in Handbook of Graph Grammars and Computing by Graph Transformation, Rozenberg, G., Ed., World Scientific, 1997, vol. 1, pp. 95-162.
    @incollection{drewes-habel-kreowski97a,
      author = {Drewes, Frank and Habel, Annegret and Kreowski, Hans-J\"org},
      title = {Hyperedge Replacement Graph Grammars},
      editor = {Rozenberg, Grzegorz},
      booktitle = {Handbook of Graph Grammars and Computing by Graph Transformation},
      volume = {1},
      chapter = {2},
      publisher = {World Scientific},
      pages = {95-162},
      year = {1997} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    J. Dassow, A. Habel, und S. Taubenberger, "Chain-Code Pictures and Collages Generated by Hyperedge Replacement," in Proc. Graph Grammars and Their Application to Computer Science, 1996, pp. 412-427.
    @inproceedings{dassow-habel-taubenberger96a,
      author = {Dassow, J\"urgen and Habel, Annegret and Taubenberger, Stefan},
      title = {Chain-Code Pictures and Collages Generated by Hyperedge Replacement},
      booktitle = {Graph Grammars and Their Application to Computer Science},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {1073},
      pages = {412-427},
      year = {1996},
      url = {http://springerlink.metapress.com/content/hx33m84871276677/} }
  • [article] bibtex
    A. Habel, R. Heckel, und G. Taentzer, "Graph Grammars with Negative Application Conditions," Fundamenta Informaticae, vol. 26, pp. 287-313, 1996.
    @article{habel-heckel-taentzer96a,
      author = {Habel, Annegret and Heckel, Reiko and Taentzer, Gabriele},
      title = {Graph Grammars with Negative Application Conditions},
      journal = {Fundamenta Informaticae},
      volume = {26},
      pages = {287-313},
      year = {1996} }
  • [article] bibtex
    A. Habel und D. Plump, "Term Graph Narrowing," Mathematical Structures in Computer Science, vol. 6, pp. 649-676, 1996.
    @article{habel-plump96a,
      author = {Habel, Annegret and Plump, Detlef},
      title = {Term Graph Narrowing},
      journal = {Mathematical Structures in Computer Science},
      volume = {6},
      pages = {649-676},
      year = {1996} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    D. Plump und A. Habel, "Graph Unification and Matching," in Proc. Graph Grammars and Their Application to Computer Science, 1996, pp. 75-89.
    @inproceedings{plump-habel96a,
      author = {Plump, Detlef and Habel, Annegret},
      title = {Graph Unification and Matching},
      editor = {Cuny, J. and Ehrig, H. and Engels, G. and Rozenberg, G.},
      booktitle = {Graph Grammars and Their Application to Computer Science},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {1073},
      pages = {75-89},
      year = {1996},
      url = {http://formale-sprachen.informatik.uni-oldenburg.de/~skript/fs-pub/graph-unification.ps.gz},
      url = {http://springerlink.metapress.com/content/v064222721ww6963/} }
  • [article] bibtex
    F. Drewes, A. Habel, H. Kreowski, und S. Taubenberger, "Generating Self-Affine Fractals by Collage Grammars," Theoretical Computer Science, vol. 145, pp. 159-187, 1995.
    @article{drewes-habel-kreowski-taubenberger95a,
      author = {Drewes, Frank and Habel, Annegret and Kreowski, Hans-J\"org and Taubenberger, Stefan},
      title = {Generating Self-Affine Fractals by Collage Grammars},
      journal = {Theoretical Computer Science},
      volume = {145},
      pages = {159-187},
      year = {1995} }
  • [inproceedings] bibtex
    A. Habel und D. Plump, "Unification, Rewriting, and Narrowing on Term Graphs," in Proc. Proc. Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 95), 1995, pp. 35-42.
    @inproceedings{habel-plump95a,
      author = {Habel, Annegret and Plump, Detlef},
      title = {Unification, Rewriting, and Narrowing on Term Graphs},
      booktitle = {Proc. Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 95)},
      series = {Electronic Notes in Theoretical Computer Science},
      volume = {2},
      publisher = {Elsevier},
      pages = {35-42},
      year = {1995} }
  • [inproceedings] bibtex
    F. Drewes, A. Habel, H. Kreowski, und S. Taubenberger, "Generating Self-Affine Fractals by Collage Grammars," in Proc. Developments in Language Theory, 1994, pp. 278-289.
    @inproceedings{drewes-habel-kreowski-taubenberger94a,
      author = {Drewes, Frank and Habel, Annegret and Kreowski, Hans-J\"org and Taubenberger, Stefan},
      title = {Generating Self-Affine Fractals by Collage Grammars},
      editor = {Rozenberg, Grzegorz and Salomaa, Arto},
      booktitle = {Developments in Language Theory},
      publisher = {World Scientific},
      pages = {278-289},
      year = {1994} }
  • [misc] bibtex
    F. Drewes, A. Habel, H. Kreowski, und S. Taubenberger, A Sketch of Collage Grammars, 1993.
    @misc{drewes-habel-kreowski-taubenberger93a,
      author = {Drewes, Frank and Habel, Annegret and Kreowski, Hans-J\"org and Taubenberger, Stefan},
      title = {A Sketch of Collage Grammars},
      journal = {Bull. EATCS},
      volume = {50},
      howpublished = {Bull. EATCS, volume 50, pages 209-219},
      pages = {209-219},
      year = {1993} }
  • [article] bibtex
    A. Habel, H. Kreowski, und C. Lautemann, "A Comparison of Compatible, Finite, and Inductive Graph Properties," Theoretical Computer Science, vol. 110, pp. 145-168, 1993.
    @article{habel-kreowski-lautemann93a,
      author = {Habel, Annegret and Kreowski, Hans-J\"org and Lautemann, Clemens},
      title = {A Comparison of Compatible, Finite, and Inductive Graph Properties},
      journal = {Theoretical Computer Science},
      volume = {110},
      pages = {145-168},
      year = {1993} }
  • [article] bibtex
    A. Habel, H. Kreowski, und S. Taubenberger, "Collages and Patterns Generated by Hyperedge Replacement," Languages of Design, vol. 1, pp. 125-145, 1993.
    @article{habel-kreowski-taubenberger93a,
      author = {Habel, Annegret and Kreowski, Hans-J\"org and Taubenberger, Stefan},
      title = {Collages and Patterns Generated by Hyperedge Replacement},
      journal = {Languages of Design},
      volume = {1},
      pages = {125-145},
      year = {1993} }
  • [article] bibtex
    H. Ehrig, A. Habel, und H. Kreowski, "Introduction to Graph Grammars with Applications to Semantic Networks," Computers \& Mathematics with Applications, vol. 23 (6-9), pp. 557-572, 1992.
    @article{ehrig-habel-kreowski92a,
      author = {Ehrig, Hartmut and Habel, Annegret and Kreowski, Hans-J\"org},
      title = {Introduction to Graph Grammars with Applications to Semantic Networks},
      journal = {Computers \& Mathematics with Applications},
      volume = {23 (6-9)},
      pages = {557-572},
      year = {1992} }
  • [book] bibtex
    A. Habel, Hyperedge Replacement: Grammars and Languages, Berlin: Springer-Verlag, 1992, vol. 643.
    @book{habel92a,
      author = {Habel, Annegret},
      title = {Hyperedge Replacement: Grammars and Languages},
      series = {Lecture Notes in Computer Science},
      volume = {643},
      publisher = {Springer-Verlag},
      address = {Berlin},
      year = {1992} }
  • [article] bibtex
    A. Habel, "Hypergraph Grammars: Transformational and Algorithmic Aspects," Journal of Information Processing and Cybernetics EIK, vol. 28, pp. 241-277, 1992.
    @article{habel92b,
      author = {Habel, Annegret},
      title = {Hypergraph Grammars: Transformational and Algorithmic Aspects},
      journal = {Journal of Information Processing and Cybernetics EIK},
      volume = {28},
      pages = {241-277},
      year = {1992} }
  • [inproceedings] bibtex
    H. Ehrig, A. Habel, H. Kreowski, und F. Parisi-Presicce, "From Graph Grammars to High Level Replacement Systems," in Proc. Graph Grammars and Their Application to Computer Science, 1991, pp. 269-291.
    @inproceedings{ehrig-habel-kreowski-parisi-presicce91a,
      author = {Ehrig, Hartmut and Habel, Annegret and Kreowski, Hans-J\"org and {Parisi-Presicce},
      Francesco},
      title = {From Graph Grammars to High Level Replacement Systems},
      booktitle = {Graph Grammars and Their Application to Computer Science},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {532},
      pages = {269-291},
      year = {1991} }
  • [article] bibtex
    H. Ehrig, A. Habel, H. Kreowski, und F. Parisi-Presicce, "Parallelism and Concurrency in High Level Replacement Systems," Mathematical Structures in Computer Science, vol. 1, pp. 361-404, 1991.
    @article{ehrig-habel-kreowski-parisi-presicce91b,
      author = {Ehrig, Hartmut and Habel, Annegret and Kreowski, Hans-J\"org and {Parisi-Presicce},
      Francesco},
      title = {Parallelism and Concurrency in High Level Replacement Systems},
      journal = {Mathematical Structures in Computer Science},
      volume = {1},
      pages = {361-404},
      year = {1991} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel und H. Kreowski, "Collage Grammars," in Proc. Graph Grammars and Their Application to Computer Science, 1991, pp. 411-429.
    @inproceedings{habel-kreowski91a,
      author = {Habel, Annegret and Kreowski, Hans-J\"org},
      title = {Collage Grammars},
      booktitle = {Graph Grammars and Their Application to Computer Science},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {532},
      pages = {411-429},
      year = {1991},
      url = {http://springerlink.metapress.com/content/575x5568587m22l2/} }
  • [article] bibtex
    A. Habel, H. Kreowski, und D. Plump, "Jungle Evaluation," Fundamenta Informaticae, vol. XV, pp. 37-60, 1991.
    @article{habel-kreowski-plump91a,
      author = {Habel, Annegret and Kreowski, Hans-J\"org and Plump, Detlef},
      title = {Jungle Evaluation},
      journal = {Fundamenta Informaticae},
      volume = {XV},
      pages = {37-60},
      year = {1991} }
  • [article] bibtex
    A. Habel, H. Kreowski, und W. Vogler, "Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge Replacement," Theoretical Computer Science, vol. 89, pp. 33-62, 1991.
    @article{habel-kreowski-vogler91a,
      author = {Habel, Annegret and Kreowski, Hans-J\"org and Vogler, Walter},
      title = {Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge Replacement},
      journal = {Theoretical Computer Science},
      volume = {89},
      pages = {33-62},
      year = {1991} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel und H. Kreowski, "Filtering Hyperedge-Replacement Languages Through Compatible Properties," in Proc. Graph-Theoretic Concepts in Computer Science, 1990, pp. 107-120.
    @inproceedings{habel-kreowski90a,
      author = {Habel, Annegret and Kreowski, Hans-J\"org},
      title = {Filtering Hyperedge-Replacement Languages Through Compatible Properties},
      booktitle = {Graph-Theoretic Concepts in Computer Science},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {411},
      pages = {107-120},
      year = {1990},
      url = {http://springerlink.metapress.com/content/f613p00247t73m74/} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel, "Graph-Theoretic Properties Compatible with Graph Derivations," in Proc. Graph-Theoretic Concepts in Computer Science, 1989, pp. 11-29.
    @inproceedings{habel89a,
      author = {Habel, Annegret},
      title = {Graph-Theoretic Properties Compatible with Graph Derivations},
      editor = {van Leeuwen, J.},
      booktitle = {Graph-Theoretic Concepts in Computer Science},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {344},
      pages = {11-29},
      year = {1989},
      url = {http://springerlink.metapress.com/content/y633m74m48026635/} }
  • [phdthesis] bibtex
    A. Habel, "Hyperedge Replacement: Grammars and Languages," PhD Thesis , 1989.
    @phdthesis{habel89b,
      author = {Habel, Annegret},
      title = {Hyperedge Replacement: Grammars and Languages},
      school = {Universit\"at Bremen},
      year = {1989} }
  • [article] bibtex
    A. Habel, H. Kreowski, und W. Vogler, "Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages," Acta Informatica, vol. 26, pp. 657-677, 1989.
    @article{habel-kreowski-vogler89a,
      author = {Habel, Annegret and Kreowski, Hans-J\"org and Vogler, Walter},
      title = {Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages},
      journal = {Acta Informatica},
      volume = {26},
      pages = {657-677},
      year = {1989} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel, H. Kreowski, und W. Vogler, "Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammars," in Proc. TAPSOFT '89, 1989, pp. 275-289.
    @inproceedings{habel-kreowski-vogler89b,
      author = {Habel, Annegret and Kreowski, Hans-J\"org and Vogler, Walter},
      title = {Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammars},
      editor = {Diaz, J. and Orejas, F.},
      booktitle = {TAPSOFT '89},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {351},
      pages = {275-289},
      year = {1989},
      url = {http://springerlink.metapress.com/content/p747024108023712/} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel und H. Kreowski, "Pretty Patterns Produced by Hyperedge Replacement," in Proc. Graph-Theoretic Concepts in Computer Science, 1988, pp. 32-45.
    @inproceedings{habel-kreowski88a,
      author = {Habel, Annegret and Kreowski, Hans-J\"org},
      title = {Pretty Patterns Produced by Hyperedge Replacement},
      booktitle = {Graph-Theoretic Concepts in Computer Science},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {314},
      pages = {32-45},
      year = {1988},
      url = {http://springerlink.metapress.com/content/p25g5415h7022853/} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel, H. Kreowski, und D. Plump, "Jungle Evaluation," in Proc. Recent Trends in Data Type Specification, 1988, pp. 92-112.
    @inproceedings{habel-kreowski-plump88a,
      author = {Habel, Annegret and Kreowski, Hans-J\"org and Plump, Detlef},
      title = {Jungle Evaluation},
      editor = {Sannella, D. and Tarlecki, A.},
      booktitle = {Recent Trends in Data Type Specification},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {332},
      pages = {92-112},
      year = {1988},
      url = {http://springerlink.metapress.com/content/7418g763m7311t51/} }
  • [article] bibtex
    P. Boehm, H. Fonio, und A. Habel, "Amalgamation of Graph Transformations: A Synchronization Mechanism," Journal of Computer and System Sciences, vol. 34, pp. 377-408, 1987.
    @article{boehm-fonio-habel87a,
      author = {Boehm, Paul and Fonio, Harald-Reto and Habel, Annegret},
      title = {Amalgamation of Graph Transformations: A Synchronization Mechanism},
      journal = {Journal of Computer and System Sciences},
      volume = {34},
      pages = {377-408},
      year = {1987} }
  • [article] bibtex
    A. Habel und H. Kreowski, "Characteristics of Graph Languages Generated by Edge Replacement," Theoretical Computer Science, vol. 51, pp. 81-115, 1987.
    @article{habel-kreowski87a,
      author = {Habel, Annegret and Kreowski, Hans-J\"org},
      title = {Characteristics of Graph Languages Generated by Edge Replacement},
      journal = {Theoretical Computer Science},
      volume = {51},
      pages = {81-115},
      year = {1987} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel und H. Kreowski, "May We Introduce to You: Hyperedge Replacement," in Proc. Graph Grammars and Their Application to Computer Science, 1987, pp. 15-26.
    @inproceedings{habel-kreowski87b,
      author = {Habel, Annegret and Kreowski, Hans-J\"org},
      title = {May We Introduce to You: Hyperedge Replacement},
      editor = {Ehrig, H. and Nagl, M. and Rozenberg, G. and Rosenfeld, A.},
      booktitle = {Graph Grammars and Their Application to Computer Science},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {291},
      pages = {15-26},
      year = {1987},
      url = {http://springerlink.metapress.com/content/7525nl048463x26r/} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel und H. Kreowski, "Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement," in Proc. STACS 87, 1987, pp. 207-219.
    @inproceedings{habel-kreowski87c,
      author = {Habel, Annegret and Kreowski, Hans-J\"org},
      title = {Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement},
      editor = {Brandenburg, F. and {Vidal-Naquet},
      G. and Wirsing, M.},
      booktitle = {STACS 87},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {247},
      pages = {207-219},
      year = {1987},
      url = {http://springerlink.metapress.com/content/7m6935111m538l2x/} }
  • [misc] bibtex
    A. Habel, H. Kreowski, und W. Vogler, Compatible Graph Properties are Decidable for Hyperedge Replacement Graph Languages, 1987.
    @misc{habel-kreowski-vogler87a,
      author = {Habel, Annegret and Kreowski, Hans-J\"org and Vogler, Walter},
      title = {Compatible Graph Properties are Decidable for Hyperedge Replacement Graph Languages},
      journal = {Bull. EATCS},
      howpublished = {Bull. EATCS, volume 33, pages 55-62},
      volume = {33},
      pages = {55-62},
      year = {1987} }
  • [inproceedings] bibtex
    H. Ehrig und A. Habel, "Graph Grammars with Application Conditions," in Proc. The Book of L, Berlin, 1986, pp. 87-100.
    @inproceedings{ehrig-habel86a,
      author = {Ehrig, Hartmut and Habel, Annegret},
      title = {Graph Grammars with Application Conditions},
      editor = {Rozenberg, G. and Salomaa, A.},
      booktitle = {The Book of L},
      publisher = {Springer-Verlag},
      address = {Berlin},
      pages = {87-100},
      year = {1986} }
  • [misc] bibtex
    H. Ehrig, A. Habel, U. Hummert, und P. Boehm, A Junction Between Algebraic Specificationas and Graph Grammmars, 1986.
    @misc{ehrig-habel-hummert-boehm86a,
      author = {Ehrig, Hartmut and Habel, Annegret and Hummert, Udo and Boehm, Paul},
      title = {A Junction Between Algebraic Specificationas and Graph Grammmars},
      journal = {Bull. EATCS},
      howpublished = {Bull. EATCS, volume 29, pages 22-27},
      volume = {29},
      pages = {22-27},
      year = {1986} }
  • [article] bibtex
    H. Ehrig, A. Habel, und B. K. Rosen, "Concurrent Transformations of Relational Structures," Fundamenta Informaticae, vol. IX, pp. 13-50, 1986.
    @article{ehrig-habel-rosen86a,
      author = {Ehrig, Hartmut and Habel, Annegret and Rosen, Barry K.},
      title = {Concurrent Transformations of Relational Structures},
      journal = {Fundamenta Informaticae},
      volume = {IX},
      pages = {13-50},
      year = {1986} }
  • [inproceedings] bibtex
    P. Boehm, H. Fonio, und A. Habel, "Amalgamation of Graph Transformations: A Synchronization Mechanism," in Proc. Mathematical Foundations of Software Development, 1985, pp. 267-283.
    @inproceedings{boehm-fonio-habel85a,
      author = {Boehm, Paul and Fonio, Harald-Reto and Habel, Annegret},
      title = {Amalgamation of Graph Transformations: A Synchronization Mechanism},
      editor = {Ehrig, H. and Floyd, C. and Nivat, M. and Thatcher, J.},
      booktitle = {Mathematical Foundations of Software Development},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {185},
      pages = {267-283},
      year = {1985} }
  • [incollection] bibtex
    H. Ehrig und A. Habel, "Concurrent Transformations of Graphs and Relational Structures," in Graph-Theoretic Concepts in Computer Science, Linz: Trauner Verlag, 1983, pp. 76-88.
    @incollection{ehrig-habel83b,
      author = {Ehrig, Hartmut and Habel, Annegret},
      title = {Concurrent Transformations of Graphs and Relational Structures},
      booktitle = {Graph-Theoretic Concepts in Computer Science},
      publisher = {Trauner Verlag},
      address = {Linz},
      pages = {76-88},
      year = {1983} }
  • [inproceedings] bibtex | Dokument aufrufen Dokument aufrufen
    A. Habel und H. Kreowski, "On Context-Free Graph Languages Generated by Edge Replacement," in Proc. Graph Grammars and Their Application to Computer Science, 1983, pp. 143-158.
    @inproceedings{habel-kreowski83a,
      author = {Habel, Annegret and Kreowski, Hans-J\"org},
      title = {On Context-Free Graph Languages Generated by Edge Replacement},
      booktitle = {Graph Grammars and Their Application to Computer Science},
      publisher = {Springer-Verlag},
      series = {Lecture Notes in Computer Science},
      volume = {153},
      pages = {143-158},
      year = {1983},
      url = {http://springerlink.metapress.com/content/p0n23615517k766r/} }
  • [techreport] bibtex
    A. Habel, "Concurrency in Graph-Grammatiken," Technische Universität Berlin, 80-11, 1980.
    @techreport{habel80a,
      author = {Habel, Annegret},
      title = {{Concurrency in Graph-Grammatiken}},
      number = {80-11},
      institution = {Technische Universit\"at Berlin},
      year = {1980} }