L
Leen Lambers
Researcher at Hasso Plattner Institute
Publications - 75
Citations - 1514
Leen Lambers is an academic researcher from Hasso Plattner Institute. The author has contributed to research in topics: Graph rewriting & Model transformation. The author has an hindex of 24, co-authored 73 publications receiving 1403 citations. Previous affiliations of Leen Lambers include Deutsche Forschungsgemeinschaft & University of Potsdam.
Papers
More filters
Journal ArticleDOI
Model transformation intents and their properties
Levi Lucio,Moussa Amrani,Juergen Dingel,Leen Lambers,Rick Salay,Gehan M. K. Selim,Eugene Syriani,Manuel Wimmer +7 more
TL;DR: A framework for the description of model transformation intents is defined, which includes a description of properties a model transformation has to satisfy to qualify as a suitable realization of an intent.
Journal ArticleDOI
M-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
TL;DR: This paper presents Local Church–Rosser, Parallelism, Concurrency and Amalgamation Theorems for rules with nested application conditions in the framework of $\mathcal{M}$-adhesive categories, where the categories are slightly more general than weak adhesive high-level replacement categories.
Book ChapterDOI
Conflict detection for graph transformation with negative application conditions
TL;DR: In this paper, a new theory needed for the purpose of conflict detection for graph transformation with negative application conditions (NACs) is introduced, and a critical pair definition is introduced and completeness of all critical pairs is shown.
Journal ArticleDOI
A Survey of Triple Graph Grammar Tools
Stephan Hildebrandt,Leen Lambers,Holger Giese,Jan Rieke,Joel Greenyer,Wilhelm Schäfer,Marius Lauder,Anthony Anjorin,Andy Schürr +8 more
TL;DR: A set of criteria for com- paring Triple Graph Grammars tools is developed and a concrete quantitative and qualitative comparison of three TGG tools is provided.
Journal ArticleDOI
M-Adhesive Transformation Systems with Nested Application Conditions. Part 2: Embedding, Critical Pairs and Local Confluence
TL;DR: A new notion of critical pair is defined which allows us to formulate and prove a Local Confluence Theorem for the general case of rules with nested application conditions, and all the results are presented, which means that their results apply to most kinds of graphical structures.