The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Annegret Habel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  48. High-Level Programs and Program Conditions. [Citation Graph (, )][DBLP]


  49. Workshop on Graph Computation Models. [Citation Graph (, )][DBLP]


  50. Local Confluence for Rules with Nested Application Conditions. [Citation Graph (, )][DBLP]


  51. Multi-Amalgamation in Adhesive Categories. [Citation Graph (, )][DBLP]


Search in 0.034secs, Finished in 0.036secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002