BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Brazil
1 × Finland
1 × Spain
1 × The Netherlands
2 × USA
3 × United Kingdom
4 × Germany
4 × Italy
Collaborated with:
H.Kreowski D.Plump H.Ehrig K.Pennemann F.Drewes S.Taubenberger U.Golas C.Peuser K.Azab B.Hoffmann H.Radke T.Arendt G.Täntzer A.Rensink R.H.Reussner J.Happe J.Müller J.Dassow P.Boehm H.Fonio W.Vogler K.Ehrig J.Padberg U.Prange F.Parisi-Presicce J.S.Becker L.Lambers F.Orejas
Talks about:
graph (13) replac (7) grammar (6) level (6) high (6) transform (5) hyperedg (4) program (4) condit (4) adhes (4)

Person: Annegret Habel

DBLP DBLP: Habel:Annegret

Facilitated 2 volumes:

GCM 2012Ed
GCM 2010Ed

Contributed to:

GCM 20152015
ICGT 20152015
ICGT 20142014
ICGT 20122012
ICGT 20102010
ICGT 20082008
ICGT 20062006
FASE 20052005
ICGT 20042004
ICGT 20022002
FoSSaCS 20012001
TAGT 19981998
Handbook of Graph Grammars 19971997
TAGT 19941994
DLT 19931993
GG 19901990
GG 19861986
GG 19821982
TAPSOFT, Vol.1: CAAP 19851985
TAPSOFT, Vol.1: CAAP 19891989

Wrote 26 papers:

GCM-2015-PeuserH #category theory #composition #graph
Attribution of Graphs by Composition of M, N-adhesive Categories (CP, AH), pp. 66–81.
ICGT-2015-RadkeABHT #constraints #graph #invariant #ocl #set
Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations (HR, TA, JSB, AH, GT), pp. 155–170.
ICGT-2014-ArendtHRT #constraints #graph #invariant #ocl
From Core OCL Invariants to Nested Graph Constraints (TA, AH, HR, GT), pp. 97–112.
M,N-Adhesive Transformation Systems (AH, DP), pp. 218–233.
ICGT-2010-EhrigHLOG #confluence
Local Confluence for Rules with Nested Application Conditions (HE, AH, LL, FO, UG), pp. 330–345.
ICGT-2010-GolasEH #category theory #multi
Multi-Amalgamation in Adhesive Categories (UG, HE, AH), pp. 346–361.
ICGT-2008-AzabH #source code
High-Level Programs and Program Conditions (KA, AH), pp. 211–225.
ICGT-2006-HabelP #satisfiability
Satisfiability of High-Level Conditions (AH, KHP), pp. 430–444.
ICGT-2006-HabelPR #source code
Weakest Preconditions for High-Level Programs (AH, KHP, AR), pp. 445–460.
FASE-2005-ReussnerHH #component #contract #graph grammar #modelling #parametricity
Modelling Parametric Contracts and the State Space of Composite Components by Graph Grammars (RHR, JH, AH), pp. 80–95.
ICGT-2004-EhrigEHP #constraints #graph
Constraints and Application Conditions: From Graphs to High-Level Structures (HE, KE, AH, KHP), pp. 287–303.
ICGT-2004-EhrigHPP #category theory
Adhesive High-Level Replacement Categories and Systems (HE, AH, JP, UP), pp. 144–160.
ICGT-2004-HabelH #graph transformation #independence #parallel
Parallel Independence in Hierarchical Graph Transformation (AH, BH), pp. 178–193.
ICGT-2002-HabelP #graph transformation
Relabelling in Graph Transformation (AH, DP), pp. 135–147.
FoSSaCS-2001-HabelP #graph transformation #programming language
Computational Completeness of Programming Languages Based on Graph Transformation (AH, DP), pp. 230–245.
TAGT-1998-HabelMP #approach #injection
Double-Pushout Approach with Injective Matching (AH, JM, DP), pp. 103–116.
GG-Handbook-Vol1-DrewesKH #graph grammar
Hyperedge Replacement, Graph Grammars (FD, HJK, AH), pp. 95–162.
Chain-Code Pictures and Collages Generated by Hyperedge Replacement (JD, AH, ST), pp. 412–427.
TAGT-1994-PlumpH #graph #unification
Graph Unification and Matching (DP, AH), pp. 75–88.
DLT-1993-DrewesHKT #generative #self
Generating Self-Affine Fractals by Collage Grammars (FD, AH, HJK, ST), pp. 278–289.
GG-1990-EhrigHKP #graph grammar
From Graph Grammars to High Level Replacement Systems (HE, AH, HJK, FPP), pp. 269–291.
Collage Grammars (AH, HJK), pp. 411–429.
May we introduce to you: hyperedge replacement (AH, HJK), pp. 15–26.
GG-1982-HabelK #on the
On context-free gragh languages generated by edge replacement (AH, HJK), pp. 143–158.
CAAP-1985-BoehmFH #graph transformation
Amalgamation of Graph Transformations with Applications to Synchronization (PB, HRF, AH), pp. 267–283.
CAAP-1989-HabelKV #bound #decidability #graph grammar #problem
Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar (AH, HJK, WV), pp. 275–289.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.