Efficient Parsing of Visual Languages based on Critical Pair Analysis and Contextual Layered Graph Transformation

Authors:
Paolo Bottoni;Gabriele Taentzer;Andy Schürr
Affiliations:
-;-;-
Venue:
VL '00 Proceedings of the 2000 IEEE International Symposium on Visual Languages (VL'00)
Year:
2000

Citing 0
Cited 23

Graphical Transformation of Multimedia XML Documents

Annals of Software Engineering
Tutorial Introduction to Graph Transformation: A Software Engineering Perspective

ICGT '02 Proceedings of the First International Conference on Graph Transformation
Confluence of Typed Attributed Graph Transformation Systems

ICGT '02 Proceedings of the First International Conference on Graph Transformation
Modeling and validation of service-oriented architectures: application vs. style

Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
A framework for modeling and implementing visual notations with applications to software engineering

ACM Transactions on Software Engineering and Methodology (TOSEM)
Attributed graph transformation with node type inheritance

Theoretical Computer Science
Termination Criteria for DPO Transformations with Injective Matches

Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs

Electronic Notes in Theoretical Computer Science (ENTCS)
Defining the abstract syntax of visual languages with advanced graph grammars-A case study based on behavior trees

Journal of Visual Languages and Computing
An Efficient Solution for Model Checking Graph Transformation Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Embedding and Confluence of Graph Transformations with Negative Application Conditions

ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Parallelism and Concurrency in Adhesive High-Level Replacement Systems with Negative Application Conditions

Electronic Notes in Theoretical Computer Science (ENTCS)
Compositionality of Model Transformations

Electronic Notes in Theoretical Computer Science (ENTCS)
Dependent and Conflicting Change Operations of Process Models

ECMDA-FA '09 Proceedings of the 5th European Conference on Model Driven Architecture - Foundations and Applications
A New Version of GTXL: An Exchange Format for Graph Transformation Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of High-Level Replacement Units with Application to Model Transformation

Electronic Notes in Theoretical Computer Science (ENTCS)
Requirements Variability Support Through MDA™ and Graph Transformation

Electronic Notes in Theoretical Computer Science (ENTCS)
High-level replacement units and their termination properties

Journal of Visual Languages and Computing
Developing usable web interfaces with the aid of automatic verification of their formal specification

Journal of Visual Languages and Computing
Detecting and resolving model inconsistencies using transformation dependency analysis

MoDELS'06 Proceedings of the 9th international conference on Model Driven Engineering Languages and Systems
Termination criteria for model transformation

FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Conflict detection for graph transformation with negative application conditions

ICGT'06 Proceedings of the Third international conference on Graph Transformations
Termination analysis of model transformations by petri nets

ICGT'06 Proceedings of the Third international conference on Graph Transformations

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes an extension of layered graph grammars (LGGs), which have been introduced for the definition of visual languages (VLs). Offering new constructs like negative application conditions (NACs) it allows one to produce more concise VL definitions. A new layering condition and critical pair analysis are the prerequisites for a new parsing algorithm, which avoids the exponential behaviour of LGGs in many cases.