Annegret Habel

Math. Struct. Comput. Sci., 2014

ℳ-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2014

Preface.

[BibT_eX]

[DOI]

Rachid Echahed

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2014

From Core OCL Invariants to Nested Graph Constraints.

[BibT_eX]

[DOI]

Proceedings of the Graph Transformation - 7th International Conference, 2014

2013

Graph Computation Models 2012.

[BibT_eX]

[DOI]

Rachid Echahed

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2013

2012

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

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

$\mathcal M, \mathcal N$ -Adhesive Transformation Systems.

[BibT_eX]

[DOI]

Proceedings of the Graph Transformations - 6th International Conference, 2012

2011

Graph Computation Models.

[BibT_eX]

[DOI]

Rachid Echahed

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011

2010

Expressiveness of graph conditions with variables.

[BibT_eX]

[DOI]

Hendrik Radke

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010

Parallelism and Concurrency Theorems for Rules with Nested Application Conditions.

[BibT_eX]

[DOI]

Leen Lambers

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010

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

[BibT_eX]

[DOI]

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010

Multi-Amalgamation in Adhesive Categories.

[BibT_eX]

[DOI]

Ulrike Golas

Proceedings of the Graph Transformations - 5th International Conference, 2010

Local Confluence for Rules with Nested Application Conditions.

[BibT_eX]

[DOI]

Proceedings of the Graph Transformations - 5th International Conference, 2010

2009

Correctness of high-level transformation systems relative to nested conditions.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2009

2008

Workshop on Graph Computation Models.

[BibT_eX]

[DOI]

Proceedings of the Graph Transformations, 4th International Conference, 2008

High-Level Programs and Program Conditions.

[BibT_eX]

[DOI]

Karl Azab

Proceedings of the Graph Transformations, 4th International Conference, 2008

2006

Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

Theory of Constraints and Application Conditions: From Graphs to High-Level Structures.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

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

[BibT_eX]

[DOI]

Karl Azab

Christian Zuckschwerdt

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2006

Weakest Preconditions for High-Level Programs.

[BibT_eX]

[DOI]

Arend Rensink

Proceedings of the Graph Transformations, Third International Conference, 2006

Satisfiability of High-Level Conditions.

[BibT_eX]

[DOI]

Proceedings of the Graph Transformations, Third International Conference, 2006

2005

Modelling Parametric Contracts and the State Space of Composite Components by Graph Grammars.

[BibT_eX]

[DOI]

Ralf H. Reussner

Jens Happe

Proceedings of the Fundamental Approaches to Software Engineering, 2005

Nested Constraints and Application Conditions for High-Level Structures.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Software and Systems Modeling, 2005

2004

Parallel Independence in Hierarchical Graph Transformation.

[BibT_eX]

[DOI]

Berthold Hoffmann

Proceedings of the Graph Transformations, Second International Conference, 2004

Adhesive High-Level Replacement Categories and Systems.

[BibT_eX]

[DOI]

Proceedings of the Graph Transformations, Second International Conference, 2004

Constraints and Application Conditions: From Graphs to High-Level Structures.

[BibT_eX]

[DOI]

Proceedings of the Graph Transformations, Second International Conference, 2004

2002

Relabelling in Graph Transformation.

[BibT_eX]

[DOI]

Proceedings of the Graph Transformation, First International Conference, 2002

2001

Double-pushout graph transformation revisited.

[BibT_eX]

[DOI]

Jürgen Müller

Math. Struct. Comput. Sci., 2001

Solving Equations by Graph Transformation.

[BibT_eX]

[DOI]

Proceedings of the GETGRATS Closing Workshop 2001, Bordeaux, France, June 22-23, 2001, 2001

Basic Results for Two Types of High-Level Replacement Systems.

[BibT_eX]

[DOI]

Francesco Parisi-Presicce

Proceedings of the GETGRATS Closing Workshop 2001, Bordeaux, France, June 22-23, 2001, 2001

Computational Completeness of Programming Languages Based on Graph Transformation.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2001

1999

Graph Transformation for Specification and Programming.

[BibT_eX]

[DOI]

Sci. Comput. Program., 1999

1998

Complete Strategies for Term Graph Narrowing.

[BibT_eX]

[DOI]

Proceedings of the Recent Trends in Algebraic Development Techniques, 1998

Double-Pushout Approach with Injective Matching.

[BibT_eX]

[DOI]

Jürgen Müller

Proceedings of the Theory and Application of Graph Transformations, 1998

1997

Hyperedge Replacement, Graph Grammars.

[BibT_eX]

Frank Drewes

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

1996

Term Graph Narrowing.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1996

Graph Grammars with Negative Application Conditions.

[BibT_eX]

[DOI]

Reiko Heckel

Gabriele Taentzer

Fundam. Informaticae, 1996

1995

Generating Self-Affine Fractals by Collage Grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Unification, rewriting, and narrowing on term graphs.

[BibT_eX]

[DOI]

Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation, 1995

1994

Graph Unification and Matching.

[BibT_eX]

[DOI]

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

Chain-Code Pictures and Collages Generated by Hyperedge Replacement.

[BibT_eX]

[DOI]

Jürgen Dassow

Stefan Taubenberger

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

1993

A Comparison of Compatible, Finite, and Inductive Graph Properties.

[BibT_eX]

[DOI]

Clemens Lautemann

Theor. Comput. Sci., 1993

A scetch of Collage Grammars.

[BibT_eX]

Bull. EATCS, 1993

1992

Hypergraph Grammars: Transformational and Algorithmic Aspects.

[BibT_eX]

J. Inf. Process. Cybern., 1992

Hyperedge Replacement: Grammars and Languages

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Parallelism and Concurrency in High-Level Replacement Systems.

[BibT_eX]

[DOI]

Francesco Parisi-Presicce

Math. Struct. Comput. Sci., 1991

Jungle evaluation.

[BibT_eX]

Fundam. Informaticae, 1991

1990

Collage Grammars.

[BibT_eX]

[DOI]

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

From Graph Grammars to High Level Replacement Systems.

[BibT_eX]

[DOI]

Francesco Parisi-Presicce

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

1989

Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages.

[BibT_eX]

[DOI]

Acta Informatica, 1989

Filtering Hyperedge-Replacement Through Compatible Properties.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

Hyperedge replacement - grammars and languages.

[BibT_eX]

[DOI]

PhD thesis, 1989

1988

Graph-Theoretic Properties Compatible with Graph Derivations.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

1987

Characteristics of Graph Languages Generated by Edge Replacement.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

Amalgamation of Graph Transformations: A Synchronization Mechanism.

[BibT_eX]

[DOI]

Paul Boehm

Harald-Reto Fonio

J. Comput. Syst. Sci., 1987

Complativle graph properties are decidable for hypergraph replacement graph languages.

[BibT_eX]

Bull. EATCS, 1987

Pretty Patterns Produced by Hyperedge Replacement.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, International Workshop, 1987

Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement.

[BibT_eX]

[DOI]

Proceedings of the STACS 87, 1987

1986

Towards algebraic data types grammars: a junction between algebraic specification and graph grammars.

[BibT_eX]

Bull. EATCS, 1986

May we introduce to you: hyperedge replacement.

[BibT_eX]

[DOI]

Proceedings of the Graph-Grammars and Their Application to Computer Science, 1986

1985

Amalgamation of Graph Transformations with Applications to Synchronization.

[BibT_eX]

[DOI]

Paul Boehm

Harald-Reto Fonio

Proceedings of the Mathematical Foundations of Software Development, 1985

1983

Concurrent Transformations of Graphs and Relational Structures.

[BibT_eX]

Proceedings of the WG '83, 1983

1982

On context-free gragh languages generated by edge replacement.

[BibT_eX]

[DOI]