Annegret Habel

According to our database1, Annegret Habel
  • authored at least 69 papers between 1982 and 2015.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2015
Composition of M, N-adhesive Categories with Application to Attribution of Graphs.
ECEASST, 2015

Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations.
Proceedings of the Graph Transformation - 8th International Conference, 2015

Attribution of Graphs by Composition of M, N-adhesive Categories.
Proceedings of the 6th International Workshop on Graph Computation Models co-located with the 8th International Conference on Graph Transformation (ICGT 2015) part of the Software Technologies: Applications and Foundations (STAF 2015) federation of conferences, 2015

2014
Multi-amalgamation of rules with application conditions in -adhesive categories.
Mathematical Structures in Computer Science, 2014

-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation.
Mathematical Structures in Computer Science, 2014

Preface.
ECEASST, 2014

From Core OCL Invariants to Nested Graph Constraints.
Proceedings of the Graph Transformation - 7th International Conference, 2014

2013
Graph Computation Models 2012.
ECEASST, 2013

2012
ℳ-Adhesive Transformation Systems with Nested Application Conditions. Part 2: Embedding, Critical Pairs and Local Confluence.
Fundam. Inform., 2012

$\mathcal M, \mathcal N$ -Adhesive Transformation Systems.
Proceedings of the Graph Transformations - 6th International Conference, 2012

2011
Graph Computation Models.
ECEASST, 2011

2010
Expressiveness of graph conditions with variables.
ECEASST, 2010

Parallelism and Concurrency Theorems for Rules with Nested Application Conditions.
ECEASST, 2010

Manipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday.
ECEASST, 2010

Multi-Amalgamation in Adhesive Categories.
Proceedings of the Graph Transformations - 5th International Conference, 2010

Local Confluence for Rules with Nested Application Conditions.
Proceedings of the Graph Transformations - 5th International Conference, 2010

2009
Correctness of high-level transformation systems relative to nested conditions.
Mathematical Structures in Computer Science, 2009

2008
Workshop on Graph Computation Models.
Proceedings of the Graph Transformations, 4th International Conference, 2008

High-Level Programs and Program Conditions.
Proceedings of the Graph Transformations, 4th International Conference, 2008

2006
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation.
Fundam. Inform., 2006

Theory of Constraints and Application Conditions: From Graphs to High-Level Structures.
Fundam. Inform., 2006

ENFORCe: A System for Ensuring Formal Correctness of High-level Programs.
ECEASST, 2006

Weakest Preconditions for High-Level Programs.
Proceedings of the Graph Transformations, Third International Conference, 2006

Satisfiability of High-Level Conditions.
Proceedings of the Graph Transformations, Third International Conference, 2006

2005
Modelling Parametric Contracts and the State Space of Composite Components by Graph Grammars.
Proceedings of the Fundamental Approaches to Software Engineering, 2005

Nested Constraints and Application Conditions for High-Level Structures.
Proceedings of the Formal Methods in Software and Systems Modeling, 2005

2004
Parallel Independence in Hierarchical Graph Transformation.
Proceedings of the Graph Transformations, Second International Conference, 2004

Adhesive High-Level Replacement Categories and Systems.
Proceedings of the Graph Transformations, Second International Conference, 2004

Constraints and Application Conditions: From Graphs to High-Level Structures.
Proceedings of the Graph Transformations, Second International Conference, 2004

2002
Relabelling in Graph Transformation.
Proceedings of the Graph Transformation, First International Conference, 2002

2001
Double-pushout graph transformation revisited.
Mathematical Structures in Computer Science, 2001

Solving Equations by Graph Transformation.
Electr. Notes Theor. Comput. Sci., 2001

Basic Results for Two Types of High-Level Replacement Systems.
Electr. Notes Theor. Comput. Sci., 2001

Computational Completeness of Programming Languages Based on Graph Transformation.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

1999
Graph Transformation for Specification and Programming.
Sci. Comput. Program., 1999

1998
Complete Strategies for Term Graph Narrowing.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1998

Double-Pushout Approach with Injective Matching.
Proceedings of the Theory and Application of Graph Transformations, 1998

1997
Hyperedge Replacement, Graph Grammars.
Proceedings of the Handbook of Graph Grammars and Computing by Graph Transformations, 1997

1996
Term Graph Narrowing.
Mathematical Structures in Computer Science, 1996

Graph Grammars with Negative Application Conditions.
Fundam. Inform., 1996

1995
Generating Self-Affine Fractals by Collage Grammars.
Theor. Comput. Sci., 1995

Unification, rewriting, and narrowing on term graphs.
Electr. Notes Theor. Comput. Sci., 1995

1994
Graph Unification and Matching.
Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

Chain-Code Pictures and Collages Generated by Hyperedge Replacement.
Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

1993
A Comparison of Compatible, Finite, and Inductive Graph Properties.
Theor. Comput. Sci., 1993

A scetch of Collage Grammars.
Bulletin of the EATCS, 1993

Generating Self-Affine Fractals by Collage Grammars.
Proceedings of the Developments in Language Theory, 1993

1992
Hypergraph Grammars: Transformational and Algorithmic Aspects.
Elektronische Informationsverarbeitung und Kybernetik, 1992

Hyperedge Replacement: Grammars and Languages
Lecture Notes in Computer Science 643, Springer, ISBN: 3-540-56005-X, 1992

1991
Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement.
Theor. Comput. Sci., 1991

Parallelism and Concurrency in High-Level Replacement Systems.
Mathematical Structures in Computer Science, 1991

Jungle evaluation.
Fundam. Inform., 1991

1990
Collage Grammars.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

From Graph Grammars to High Level Replacement Systems.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

1989
Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages.
Acta Inf., 1989

Filtering Hyperedge-Replacement Through Compatible Properties.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar.
Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

Hyperedge replacement - grammars and languages.
PhD thesis, 1989

1988
Graph-Theoretic Properties Compatible with Graph Derivations.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

1987
Characteristics of Graph Languages Generated by Edge Replacement.
Theor. Comput. Sci., 1987

Amalgamation of Graph Transformations: A Synchronization Mechanism.
J. Comput. Syst. Sci., 1987

Complativle graph properties are decidable for hypergraph replacement graph languages.
Bulletin of the EATCS, 1987

Pretty Patterns Produced by Hyperedge Replacement.
Proceedings of the Graph-Theoretic Concepts in Computer Science, International Workshop, 1987

Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement.
Proceedings of the STACS 87, 1987

Jungle Evaluation.
Proceedings of the Recent Trends in Data Type Specification, 1987

1986
Towards algebraic data types grammars: a junction between algebraic specification and graph grammars.
Bulletin of the EATCS, 1986

May we introduce to you: hyperedge replacement.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1986

1985
Amalgamation of Graph Transformations with Applications to Synchronization.
Proceedings of the Mathematical Foundations of Software Development, 1985

1982
On context-free gragh languages generated by edge replacement.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1982


  Loading...