Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation
A formal graph transformation based language for model-to-model transformations
A formal graph transformation based language for model-to-model transformations
Description Logics for Shape Analysis
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Electronic Notes in Theoretical Computer Science (ENTCS)
Tool Integration with Triple Graph Grammars - A Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
Resolution-Like Theorem Proving for High-Level Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Formal Verification of Graph Grammars using Mathematical Induction
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of graph grammars using a logical approach
Science of Computer Programming
Formal verification techniques for model transformations specified by-demonstration
Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering
Graph transformations for MDE, adaptation, and models at runtime
SFM'12 Proceedings of the 12th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: formal methods for model-driven engineering
Locality in reasoning about graph transformations
AGTIVE'11 Proceedings of the 4th international conference on Applications of Graph Transformations with Industrial Relevance
Specification patterns for properties over reachable states of graph grammars
SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
| Hi-index | 0.00 |
This paper takes first steps towards a formalization of graph transformations in a general setting of interactive theorem provers, which will form the basis for proofs of correctness of graph transformation systems. Whereas graph rewriting is usually performed by mapping a pattern graph into a source graph by means of a graph morphism and then carrying out operations on the image node and edge set, this article generalises the notion of pattern graph to path expressions, which are formulae in a fragment of first-order logic. We examine the correspondence with traditional graph rewriting and show that this interpretation is beneficial when formally reasoning about model transformations with the aid of proof assistants.