Journal of the ACM (JACM)
Properties of Programs and the First-Order Predicate Calculus
Journal of the ACM (JACM)
Correspondence between ALGOL 60 and Church's Lambda-notation: part I
Communications of the ACM
EULER: a generalization of ALGOL and it formal definition: Part 1
Communications of the ACM
Syntax-directed interpretation of classes of pictures
Communications of the ACM
Revised report on the algorithm language ALGOL 60
Communications of the ACM
Linguistic methods in picture processing: a survey
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
A hierarchical graph model of the semantics of programs
AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
Regular expressions and the equivalence of programs
Journal of Computer and System Sciences
A Combined Graph Schema and Graph Grammar Approach to Consistency in Distributed Data Modeling
AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
Graph-Based Reverse Engineering and Reengineering Tools
AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
From Graph Transformation to Rule-Based Programming with Diagrams
AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
Hierarchical Graph Transformation
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Rule-Based Specification of Behavioral Consistency Based on the UML Meta-model
«UML» '01 Proceedings of the 4th International Conference on The Unified Modeling Language, Modeling Languages, Concepts, and Tools
Tutorial Introduction to Graph Transformation: A Software Engineering Perspective
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Incremental Transformation of Lattices: A Key to Effective Knowledge Discovery
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Journal of Visual Languages and Computing
15 Years of Triple Graph Grammars
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Transforming Scene Graphs Using Triple Graph Grammars --- A Practice Report
Applications of Graph Transformations with Industrial Relevance
Domain Specific Languages with Graphical and Textual Views
Applications of Graph Transformations with Industrial Relevance
On Integrating OCL and Triple Graph Grammars
Models in Software Engineering
Bidirectional Transformations: A Cross-Discipline Perspective
ICMT '09 Proceedings of the 2nd International Conference on Theory and Practice of Model Transformations
Semantics of Visual Models in a Rule-based Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
Tool Integration with Triple Graph Grammars - A Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
Graph Transformation in a Nutshell
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Visual Languages and Computing
From graph transformation to software engineering and back
Formal Methods in Software and Systems Modeling
Temporal graph queries to support software evolution
ICGT'06 Proceedings of the Third international conference on Graph Transformations
A graphical specification of model transformations with triple graph grammars
ECMDA-FA'05 Proceedings of the First European conference on Model Driven Architecture: foundations and Applications
GRAPH GRAMMARS WITH NEGATIVE APPLICATION CONDITIONS
Fundamenta Informaticae
Hi-index | 0.01 |
Translation between string and graph representations of programs and data may be formally defined by means of pair grammars. A pair grammar is composed of a pair of grammars whose rules and nonterminals are paired. The pair grammar defines a correspondence between elements of the languages defined by the two grammars. This correspondence may be viewed as a definition of the translation of the elements of one language into the elements of the other. Of particular interest is the case in which the first language is a set of strings and the second is a set of directed graphs with labeled arcs and nodes. Preliminary to the definition of pair grammars, a class of graph grammars are defined which are a generalization of ordinary context-free grammars. A graph grammar defines a language composed of a set of directed graphs. Pair grammars are constructed from pairs of graph grammars. Each unambiguous pair grammar defines a reversible function mapping one graph language onto another. Special cases of interest include string-to-graph, graph-to-string, and string-to-string mappings. In the general case a pair grammar defines a transformation on a set of graphs. Two extensions to the elementary pair grammars allow representation of hierarchies of graphs and constructs such as labels and go to statements. Examples are given of the translation of a major subset of Algol into flowchart graphs and the translation of Lisp S-expressions into list structure graphs with structured atoms.