Annegret Habel

74 papers A 1B 19C 1Journal 31Unranked 19

Year	Rank	Type	Title / Venue / Authors
2019	—	`conf`	Rule-based Graph Repair. GCM@STAF Christian Sandmann, Annegret Habel
2018	—	`conf`	Graph Repair by Graph Programs. STAF Workshops Annegret Habel, Christian Sandmann
2018	—	`conf`	Integration of Graph Constraints into Graph Grammars. Graph Transformation, Specifications, and Nets Annegret Habel, Christian Sandmann, Tilman Teusch
2018	J	`jnl`	Translating essential OCL invariants to nested graph constraints for generating instances of meta-models. Sci. Comput. Program. Hendrik Radke, Thorsten Arendt, Jan Steffen Becker, Annegret Habel, Gabriele Taentzer
2015	—	`conf`	Attribution of Graphs by Composition of M, N-adhesive Categories. GCM@ICGT Christoph Peuser, Annegret Habel
2015	J	`jnl`	Composition of M, N-adhesive Categories with Application to Attribution of Graphs. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Christoph Peuser, Annegret Habel
2015	B	`conf`	Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations. ICGT Hendrik Radke, Thorsten Arendt, Jan Steffen Becker, Annegret Habel, Gabriele Taentzer
2014	B	`conf`	From Core OCL Invariants to Nested Graph Constraints. ICGT Thorsten Arendt, Annegret Habel, Hendrik Radke, Gabriele Taentzer
2014	J	`jnl`	Multi-amalgamation of rules with application conditions in ℳ-adhesive categories. Math. Struct. Comput. Sci. Ulrike Golas, Annegret Habel, Hartmut Ehrig
2014	J	`jnl`	Preface. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Rachid Echahed, Annegret Habel, Mohamed Mosbah
2014	J	`jnl`	ℳ-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation. Math. Struct. Comput. Sci. Hartmut Ehrig, Ulrike Golas, Annegret Habel, Leen Lambers, Fernando Orejas
2013	J	`jnl`	Graph Computation Models 2012. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Rachid Echahed, Annegret Habel, Mohamed Mosbah
2012	B	`conf`	$\mathcal M, \mathcal N$ -Adhesive Transformation Systems. ICGT Annegret Habel, Detlef Plump
2012	J	`jnl`	ℳ-Adhesive Transformation Systems with Nested Application Conditions. Part 2: Embedding, Critical Pairs and Local Confluence. Fundam. Informaticae Hartmut Ehrig, Ulrike Golas, Annegret Habel, Leen Lambers, Fernando Orejas
2011	J	`jnl`	Graph Computation Models. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Rachid Echahed, Annegret Habel, Mohamed Mosbah
2010	J	`jnl`	Expressiveness of graph conditions with variables. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Annegret Habel, Hendrik Radke
2010	B	`conf`	Local Confluence for Rules with Nested Application Conditions. ICGT Hartmut Ehrig, Annegret Habel, Leen Lambers, Fernando Orejas, Ulrike Golas
2010	J	`jnl`	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. Frank Drewes, Annegret Habel, Berthold Hoffmann, Detlef Plump
2010	B	`conf`	Multi-Amalgamation in Adhesive Categories. ICGT Ulrike Golas, Hartmut Ehrig, Annegret Habel
2010	J	`jnl`	Parallelism and Concurrency Theorems for Rules with Nested Application Conditions. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Hartmut Ehrig, Annegret Habel, Leen Lambers
2009	J	`jnl`	Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. Annegret Habel, Karl-Heinz Pennemann
2008	B	`conf`	High-Level Programs and Program Conditions. ICGT Karl Azab, Annegret Habel
2008	B	`conf`	Workshop on Graph Computation Models. ICGT Mohamed Mosbah, Annegret Habel
2006	J	`jnl`	Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation. Fundam. Informaticae Hartmut Ehrig, Julia Padberg, Ulrike Prange, Annegret Habel
2006	J	`jnl`	ENFORCe: A System for Ensuring Formal Correctness of High-level Programs. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Karl Azab, Annegret Habel, Karl-Heinz Pennemann, Christian Zuckschwerdt
2006	B	`conf`	Satisfiability of High-Level Conditions. ICGT Annegret Habel, Karl-Heinz Pennemann
2006	J	`jnl`	Theory of Constraints and Application Conditions: From Graphs to High-Level Structures. Fundam. Informaticae Hartmut Ehrig, Karsten Ehrig, Annegret Habel, Karl-Heinz Pennemann
2006	B	`conf`	Weakest Preconditions for High-Level Programs. ICGT Annegret Habel, Karl-Heinz Pennemann, Arend Rensink
2005	B	`conf`	Modelling Parametric Contracts and the State Space of Composite Components by Graph Grammars. FASE Ralf H. Reussner, Jens Happe, Annegret Habel
2005	—	`conf`	Nested Constraints and Application Conditions for High-Level Structures. Formal Methods in Software and Systems Modeling Annegret Habel, Karl-Heinz Pennemann
2004	B	`conf`	Adhesive High-Level Replacement Categories and Systems. ICGT Hartmut Ehrig, Annegret Habel, Julia Padberg, Ulrike Prange
2004	B	`conf`	Constraints and Application Conditions: From Graphs to High-Level Structures. ICGT Hartmut Ehrig, Karsten Ehrig, Annegret Habel, Karl-Heinz Pennemann
2004	B	`conf`	Parallel Independence in Hierarchical Graph Transformation. ICGT Annegret Habel, Berthold Hoffmann
2002	B	`conf`	Relabelling in Graph Transformation. ICGT Annegret Habel, Detlef Plump
2001	—	`conf`	Basic Results for Two Types of High-Level Replacement Systems. GETGRATS Closing Workshop Hartmut Ehrig, Annegret Habel, Francesco Parisi-Presicce
2001	B	`conf`	Computational Completeness of Programming Languages Based on Graph Transformation. FoSSaCS Annegret Habel, Detlef Plump
2001	J	`jnl`	Double-pushout graph transformation revisited. Math. Struct. Comput. Sci. Annegret Habel, Jürgen Müller, Detlef Plump
2001	—	`conf`	Solving Equations by Graph Transformation. GETGRATS Closing Workshop Annegret Habel, Detlef Plump
1999	J	`jnl`	Graph Transformation for Specification and Programming. Sci. Comput. Program. Marc Andries, Gregor Engels, Annegret Habel, Berthold Hoffmann, Hans-Jörg Kreowski, Sabine Kuske, Detlef Plump, Andy Schürr, Gabriele Taentzer
1998	—	`conf`	Complete Strategies for Term Graph Narrowing. WADT Annegret Habel, Detlef Plump
1998	—	`conf`	Double-Pushout Approach with Injective Matching. TAGT Annegret Habel, Jürgen Müller, Detlef Plump
1997	—	`ch.`	Hyperedge Replacement, Graph Grammars. Handbook of Graph Grammars Frank Drewes, Hans-Jörg Kreowski, Annegret Habel
1996	J	`jnl`	Graph Grammars with Negative Application Conditions. Fundam. Informaticae Annegret Habel, Reiko Heckel, Gabriele Taentzer
1996	J	`jnl`	Term Graph Narrowing. Math. Struct. Comput. Sci. Annegret Habel, Detlef Plump
1995	J	`jnl`	Generating Self-Affine Fractals by Collage Grammars. Theor. Comput. Sci. Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger
1995	—	`conf`	Unification, rewriting, and narrowing on term graphs. SEGRAGRA Annegret Habel, Detlef Plump
1994	—	`conf`	Chain-Code Pictures and Collages Generated by Hyperedge Replacement. TAGT Jürgen Dassow, Annegret Habel, Stefan Taubenberger
1994	—	`conf`	Graph Unification and Matching. TAGT Detlef Plump, Annegret Habel
1993	J	`jnl`	A Comparison of Compatible, Finite, and Inductive Graph Properties. Theor. Comput. Sci. Annegret Habel, Hans-Jörg Kreowski, Clemens Lautemann
1993	J	`jnl`	A scetch of Collage Grammars. Bull. EATCS Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger
1993	C	`conf`	Generating Self-Affine Fractals by Collage Grammars. Developments in Language Theory Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger
1992	—	`book`	Hyperedge Replacement: Grammars and Languages Annegret Habel
1992	J	`jnl`	Hypergraph Grammars: Transformational and Algorithmic Aspects. J. Inf. Process. Cybern. Annegret Habel
1991	J	`jnl`	Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement. Theor. Comput. Sci. Annegret Habel, Hans-Jörg Kreowski, Walter Vogler
1991	J	`jnl`	Jungle evaluation. Fundam. Informaticae Annegret Habel, Hans-Jörg Kreowski, Detlef Plump
1991	J	`jnl`	Parallelism and Concurrency in High-Level Replacement Systems. Math. Struct. Comput. Sci. Hartmut Ehrig, Annegret Habel, Hans-Jörg Kreowski, Francesco Parisi-Presicce
1990	—	`conf`	Collage Grammars. Graph-Grammars and Their Application to Computer Science Annegret Habel, Hans-Jörg Kreowski
1990	—	`conf`	From Graph Grammars to High Level Replacement Systems. Graph-Grammars and Their Application to Computer Science Hartmut Ehrig, Annegret Habel, Hans-Jörg Kreowski, Francesco Parisi-Presicce
1989	—	`conf`	Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar. TAPSOFT, Vol.1 Annegret Habel, Hans-Jörg Kreowski, Walter Vogler
1989	B	`conf`	Filtering Hyperedge-Replacement Through Compatible Properties. WG Annegret Habel, Hans-Jörg Kreowski
1989	—	`—`	Hyperedge replacement - grammars and languages. Annegret Habel
1989	J	`jnl`	Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages. Acta Informatica Annegret Habel, Hans-Jörg Kreowski, Walter Vogler
1988	B	`conf`	Graph-Theoretic Properties Compatible with Graph Derivations. WG Annegret Habel
1987	J	`jnl`	Amalgamation of Graph Transformations: A Synchronization Mechanism. J. Comput. Syst. Sci. Paul Boehm, Harald-Reto Fonio, Annegret Habel
1987	J	`jnl`	Characteristics of Graph Languages Generated by Edge Replacement. Theor. Comput. Sci. Annegret Habel, Hans-Jörg Kreowski
1987	J	`jnl`	Complativle graph properties are decidable for hypergraph replacement graph languages. Bull. EATCS Annegret Habel, Hans-Jörg Kreowski, Walter Vogler
1987	—	`conf`	Jungle Evaluation. ADT Annegret Habel, Hans-Jörg Kreowski, Detlef Plump
1987	B	`conf`	Pretty Patterns Produced by Hyperedge Replacement. WG Annegret Habel, Hans-Jörg Kreowski
1987	A	`conf`	Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement. STACS Annegret Habel, Hans-Jörg Kreowski
1986	—	`conf`	May we introduce to you: hyperedge replacement. Graph-Grammars and Their Application to Computer Science Annegret Habel, Hans-Jörg Kreowski
1986	J	`jnl`	Towards algebraic data types grammars: a junction between algebraic specification and graph grammars. Bull. EATCS Hartmut Ehrig, Annegret Habel, Udo Hummert, Paul Boehm
1985	—	`conf`	Amalgamation of Graph Transformations with Applications to Synchronization. TAPSOFT, Vol.1 Paul Boehm, Harald-Reto Fonio, Annegret Habel
1983	B	`conf`	Concurrent Transformations of Graphs and Relational Structures. WG Hartmut Ehrig, Annegret Habel
1982	—	`conf`	On context-free gragh languages generated by edge replacement. Graph-Grammars and Their Application to Computer Science Annegret Habel, Hans-Jörg Kreowski