default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnegret Habel
Person information
- affiliation: University of Oldenburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c40]Christian Sandmann, Annegret Habel:
Rule-based Graph Repair. GCM@STAF 2019: 87-104- 2018
- [j31]Hendrik Radke, Thorsten Arendt, Jan Steffen Becker, Annegret Habel, Gabriele Taentzer:
Translating essential OCL invariants to nested graph constraints for generating instances of meta-models. Sci. Comput. Program. 152: 38-62 (2018) - [c39]Annegret Habel, Christian Sandmann, Tilman Teusch:
Integration of Graph Constraints into Graph Grammars. Graph Transformation, Specifications, and Nets 2018: 19-36 - [c38]Annegret Habel, Christian Sandmann:
Graph Repair by Graph Programs. STAF Workshops 2018: 431-446 - 2015
- [j30]Christoph Peuser, Annegret Habel:
Composition of M, N-adhesive Categories with Application to Attribution of Graphs. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 73 (2015) - [c37]Christoph Peuser, Annegret Habel:
Attribution of Graphs by Composition of M, N-adhesive Categories. GCM@ICGT 2015: 66-81 - [c36]Hendrik Radke, Thorsten Arendt, Jan Steffen Becker, Annegret Habel, Gabriele Taentzer:
Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations. ICGT 2015: 155-170 - 2014
- [j29]Rachid Echahed, Annegret Habel, Mohamed Mosbah:
Preface. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 71 (2014) - [j28]Hartmut Ehrig, Ulrike Golas
, Annegret Habel, Leen Lambers, Fernando Orejas:
ℳ-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation. Math. Struct. Comput. Sci. 24(4) (2014) - [j27]Ulrike Golas, Annegret Habel, Hartmut Ehrig:
Multi-amalgamation of rules with application conditions in ℳ-adhesive categories. Math. Struct. Comput. Sci. 24(4) (2014) - [c35]Thorsten Arendt, Annegret Habel, Hendrik Radke, Gabriele Taentzer:
From Core OCL Invariants to Nested Graph Constraints. ICGT 2014: 97-112 - 2013
- [j26]Rachid Echahed, Annegret Habel, Mohamed Mosbah:
Graph Computation Models 2012. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 61 (2013) - 2012
- [j25]Hartmut Ehrig, Ulrike Golas, Annegret Habel, Leen Lambers, Fernando Orejas:
ℳ-Adhesive Transformation Systems with Nested Application Conditions. Part 2: Embedding, Critical Pairs and Local Confluence. Fundam. Informaticae 118(1-2): 35-63 (2012) - [c34]Annegret Habel, Detlef Plump:
$\mathcal M, \mathcal N$ -Adhesive Transformation Systems. ICGT 2012: 218-233 - 2011
- [j24]Rachid Echahed, Annegret Habel, Mohamed Mosbah:
Graph Computation Models. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 39 (2011) - 2010
- [j23]Frank Drewes, Annegret Habel, Berthold Hoffmann, Detlef Plump:
Manipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 26 (2010) - [j22]Hartmut Ehrig, Annegret Habel, Leen Lambers:
Parallelism and Concurrency Theorems for Rules with Nested Application Conditions. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 26 (2010) - [j21]Annegret Habel, Hendrik Radke:
Expressiveness of graph conditions with variables. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 30 (2010) - [c33]Hartmut Ehrig, Annegret Habel, Leen Lambers, Fernando Orejas, Ulrike Golas:
Local Confluence for Rules with Nested Application Conditions. ICGT 2010: 330-345 - [c32]Ulrike Golas, Hartmut Ehrig, Annegret Habel:
Multi-Amalgamation in Adhesive Categories. ICGT 2010: 346-361
2000 – 2009
- 2009
- [j20]Annegret Habel, Karl-Heinz Pennemann:
Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19(2): 245-296 (2009) - 2008
- [c31]Karl Azab, Annegret Habel:
High-Level Programs and Program Conditions. ICGT 2008: 211-225 - [c30]Mohamed Mosbah, Annegret Habel:
Workshop on Graph Computation Models. ICGT 2008: 460-462 - 2006
- [j19]Karl Azab, Annegret Habel, Karl-Heinz Pennemann, Christian Zuckschwerdt:
ENFORCe: A System for Ensuring Formal Correctness of High-level Programs. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 1 (2006) - [j18]Hartmut Ehrig, Julia Padberg, Ulrike Prange, Annegret Habel:
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation. Fundam. Informaticae 74(1): 1-29 (2006) - [j17]Hartmut Ehrig, Karsten Ehrig, Annegret Habel, Karl-Heinz Pennemann:
Theory of Constraints and Application Conditions: From Graphs to High-Level Structures. Fundam. Informaticae 74(1): 135-166 (2006) - [c29]Annegret Habel, Karl-Heinz Pennemann:
Satisfiability of High-Level Conditions. ICGT 2006: 430-444 - [c28]Annegret Habel, Karl-Heinz Pennemann, Arend Rensink:
Weakest Preconditions for High-Level Programs. ICGT 2006: 445-460 - 2005
- [c27]Annegret Habel, Karl-Heinz Pennemann:
Nested Constraints and Application Conditions for High-Level Structures. Formal Methods in Software and Systems Modeling 2005: 293-308 - [c26]Ralf H. Reussner, Jens Happe, Annegret Habel:
Modelling Parametric Contracts and the State Space of Composite Components by Graph Grammars. FASE 2005: 80-95 - 2004
- [c25]Hartmut Ehrig, Annegret Habel, Julia Padberg, Ulrike Prange:
Adhesive High-Level Replacement Categories and Systems. ICGT 2004: 144-160 - [c24]Annegret Habel, Berthold Hoffmann:
Parallel Independence in Hierarchical Graph Transformation. ICGT 2004: 178-193 - [c23]Hartmut Ehrig, Karsten Ehrig, Annegret Habel, Karl-Heinz Pennemann:
Constraints and Application Conditions: From Graphs to High-Level Structures. ICGT 2004: 287-303 - 2002
- [c22]Annegret Habel, Detlef Plump:
Relabelling in Graph Transformation. ICGT 2002: 135-147 - 2001
- [j16]Annegret Habel, Jürgen Müller, Detlef Plump:
Double-pushout graph transformation revisited. Math. Struct. Comput. Sci. 11(5): 637-688 (2001) - [c21]Annegret Habel, Detlef Plump:
Computational Completeness of Programming Languages Based on Graph Transformation. FoSSaCS 2001: 230-245 - [c20]Hartmut Ehrig, Annegret Habel, Francesco Parisi-Presicce:
Basic Results for Two Types of High-Level Replacement Systems. GETGRATS Closing Workshop 2001: 127-138 - [c19]Annegret Habel, Detlef Plump:
Solving Equations by Graph Transformation. GETGRATS Closing Workshop 2001: 165-176
1990 – 1999
- 1999
- [j15]Marc Andries, Gregor Engels, Annegret Habel, Berthold Hoffmann, Hans-Jörg Kreowski, Sabine Kuske, Detlef Plump, Andy Schürr, Gabriele Taentzer:
Graph Transformation for Specification and Programming. Sci. Comput. Program. 34(1): 1-54 (1999) - 1998
- [c18]Annegret Habel, Jürgen Müller, Detlef Plump:
Double-Pushout Approach with Injective Matching. TAGT 1998: 103-116 - [c17]Annegret Habel, Detlef Plump:
Complete Strategies for Term Graph Narrowing. WADT 1998: 152-167 - 1997
- [p1]Frank Drewes, Hans-Jörg Kreowski, Annegret Habel:
Hyperedge Replacement, Graph Grammars. Handbook of Graph Grammars 1997: 95-162 - 1996
- [j14]Annegret Habel, Reiko Heckel, Gabriele Taentzer:
Graph Grammars with Negative Application Conditions. Fundam. Informaticae 26(3/4): 287-313 (1996) - [j13]Annegret Habel, Detlef Plump:
Term Graph Narrowing. Math. Struct. Comput. Sci. 6(6): 649-676 (1996) - 1995
- [j12]Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger:
Generating Self-Affine Fractals by Collage Grammars. Theor. Comput. Sci. 145(1&2): 159-187 (1995) - [c16]Annegret Habel, Detlef Plump:
Unification, rewriting, and narrowing on term graphs. SEGRAGRA 1995: 110-117 - 1994
- [c15]Detlef Plump, Annegret Habel:
Graph Unification and Matching. TAGT 1994: 75-88 - [c14]Jürgen Dassow, Annegret Habel, Stefan Taubenberger:
Chain-Code Pictures and Collages Generated by Hyperedge Replacement. TAGT 1994: 412-427 - 1993
- [j11]Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger:
A scetch of Collage Grammars. Bull. EATCS 50: 209-219 (1993) - [j10]Annegret Habel, Hans-Jörg Kreowski, Clemens Lautemann:
A Comparison of Compatible, Finite, and Inductive Graph Properties. Theor. Comput. Sci. 110(1): 145-168 (1993) - [c13]Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger:
Generating Self-Affine Fractals by Collage Grammars. Developments in Language Theory 1993: 278-289 - 1992
- [b2]Annegret Habel:
Hyperedge Replacement: Grammars and Languages. Lecture Notes in Computer Science 643, Springer 1992, ISBN 3-540-56005-X - [j9]Annegret Habel:
Hypergraph Grammars: Transformational and Algorithmic Aspects. J. Inf. Process. Cybern. 28(5): 241-277 (1992) - 1991
- [j8]Annegret Habel, Hans-Jörg Kreowski, Detlef Plump:
Jungle evaluation. Fundam. Informaticae 15(1): 37-60 (1991) - [j7]Hartmut Ehrig, Annegret Habel, Hans-Jörg Kreowski, Francesco Parisi-Presicce:
Parallelism and Concurrency in High-Level Replacement Systems. Math. Struct. Comput. Sci. 1(3): 361-404 (1991) - [j6]Annegret Habel, Hans-Jörg Kreowski, Walter Vogler:
Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement. Theor. Comput. Sci. 89(1): 33-62 (1991) - 1990
- [c12]Hartmut Ehrig, Annegret Habel, Hans-Jörg Kreowski, Francesco Parisi-Presicce:
From Graph Grammars to High Level Replacement Systems. Graph-Grammars and Their Application to Computer Science 1990: 269-291 - [c11]Annegret Habel, Hans-Jörg Kreowski:
Collage Grammars. Graph-Grammars and Their Application to Computer Science 1990: 411-429
1980 – 1989
- 1989
- [b1]Annegret Habel:
Hyperedge replacement - grammars and languages. University of Bremen, Germany, 1989, pp. 1-193 - [j5]Annegret Habel, Hans-Jörg Kreowski, Walter Vogler:
Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages. Acta Informatica 26(7): 657-677 (1989) - [c10]Annegret Habel, Hans-Jörg Kreowski, Walter Vogler:
Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar. TAPSOFT, Vol.1 1989: 275-289 - [c9]Annegret Habel, Hans-Jörg Kreowski:
Filtering Hyperedge-Replacement Through Compatible Properties. WG 1989: 107-120 - 1988
- [c8]Annegret Habel:
Graph-Theoretic Properties Compatible with Graph Derivations. WG 1988: 11-29 - 1987
- [j4]Annegret Habel, Hans-Jörg Kreowski, Walter Vogler:
Complativle graph properties are decidable for hypergraph replacement graph languages. Bull. EATCS 33: 55-61 (1987) - [j3]Paul Boehm, Harald-Reto Fonio, Annegret Habel:
Amalgamation of Graph Transformations: A Synchronization Mechanism. J. Comput. Syst. Sci. 34(2/3): 377-408 (1987) - [j2]Annegret Habel, Hans-Jörg Kreowski:
Characteristics of Graph Languages Generated by Edge Replacement. Theor. Comput. Sci. 51: 81-115 (1987) - [c7]Annegret Habel, Hans-Jörg Kreowski, Detlef Plump:
Jungle Evaluation. ADT 1987: 92-112 - [c6]Annegret Habel, Hans-Jörg Kreowski:
Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement. STACS 1987: 207-219 - [c5]Annegret Habel, Hans-Jörg Kreowski:
Pretty Patterns Produced by Hyperedge Replacement. WG 1987: 32-45 - 1986
- [j1]Hartmut Ehrig, Annegret Habel, Udo Hummert, Paul Boehm:
Towards algebraic data types grammars: a junction between algebraic specification and graph grammars. Bull. EATCS 29: 22-26 (1986) - [c4]Annegret Habel, Hans-Jörg Kreowski:
May we introduce to you: hyperedge replacement. Graph-Grammars and Their Application to Computer Science 1986: 15-26 - 1985
- [c3]Paul Boehm, Harald-Reto Fonio, Annegret Habel:
Amalgamation of Graph Transformations with Applications to Synchronization. TAPSOFT, Vol.1 1985: 267-283 - 1983
- [c2]Hartmut Ehrig, Annegret Habel:
Concurrent Transformations of Graphs and Relational Structures. WG 1983: 76-88 - 1982
- [c1]Annegret Habel, Hans-Jörg Kreowski:
On context-free gragh languages generated by edge replacement. Graph-Grammars and Their Application to Computer Science 1982: 143-158
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
