JiříAdámek, Horst Herrlich & George Strecker (1990):
Abstract and Concrete Categories.
Wiley.
Luciano Baresi, Vahid Rafe, Adel T. Rahmani & Paola Spoletini (2008):
An Efficient Solution for Model Checking Graph Transformation Systems.
Electronic Notes in Theoretical Computer Science 213(1),
pp. 3–21,
doi:10.1016/j.entcs.2008.04.071.
Yves Bertot & Pierre Castéran (2004):
Interactive Theorem Proving and Program Development — Coq'Art: The Calculus of Inductive Constructions.
Texts in Theoretical Computer Science.
Springer,
doi:10.1007/978-3-662-07964-5.
Jon Haël Brenas, Rachid Echahed & Martin Strecker (2018):
Verifying graph transformations with guarded logics.
In: 2018 International Symposium on Theoretical Aspects of Software Engineering (TASE).
IEEE,
pp. 124–131,
doi:10.1109/TASE.2018.00024.
Graham Campbell, Brian Courtehoute & Detlef Plump (2022):
Fast Rule-Based Graph Programs.
Science of Computer Programming 214,
doi:10.1016/j.scico.2021.102727.
Simone André da Costa Cavalheiro, Luciana Foss & Leila Ribeiro (2017):
Theorem proving graph grammars with attributes and negative application conditions.
Theoretical computer science 686,
pp. 25–77,
doi:10.1016/j.tcs.2017.04.010.
Mark Dowson (1997):
The Ariane 5 software failure.
ACM SIGSOFT Software Engineering Notes 22(2),
pp. 84,
doi:10.1145/251880.251992.
Hartmut Ehrig (1979):
Introduction to the Algebraic Theory of Graph Grammars.
In: Proc. Graph-Grammars and Their Application to Computer Science and Biology,
Lecture Notes in Computer Science 73.
Springer-Verlag,
pp. 1–69,
doi:10.1007/BFb0025714.
eptcs@eptcs.org