References

  1. Jørgen Bang-Jensen & Gregory Gutin (2009): Digraphs: Theory, Algorithms and Applications, second edition. Springer-Verlag.
  2. R. J. Duffin (1965): Topology of Series-Parallel Networks. Journal of Mathematical Analysis and Applications 10(2), pp. 303–318, doi:10.1016/0022-247X(65)90125-3.
  3. Annegret Habel & Detlef Plump (2002): Relabelling in Graph Transformation. In: Proc. International Conference on Graph Transformation (ICGT 2002), Lecture Notes in Computer Science 2505. Springer-Verlag, pp. 135–147, doi:10.1007/3-540-45832-8_12.
  4. Greg Manning & Detlef Plump (2008): The GP Programming System. In: Proc. Graph Transformation and Visual Modelling Techniques (GT-VMT 2008), Electronic Communications of the EASST 10.
  5. Gordon D. Plotkin (2004): A Structural Approach to Operational Semantics. Journal of Logic and Algebraic Programming 60–61, pp. 17–139, doi:10.1016/j.jlap.2004.05.001.
  6. Detlef Plump (2005): Confluence of Graph Transformation Revisited. In: Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk & Roel de Vrijer: Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday, Lecture Notes in Computer Science 3838. Springer-Verlag, pp. 280–308, doi:10.1007/11601548.
  7. Detlef Plump (2009): The Graph Programming Language GP. In: Proc. International Conference on Algebraic Informatics (CAI 2009), Lecture Notes in Computer Science 5725. Springer-Verlag, pp. 99–122, doi:10.1007/978-3-642-03564-7_6.
  8. Detlef Plump & Sandra Steinert (2010): The Semantics of Graph Programs. In: Proc. Rule-Based Programming (RULE 2009), Electronic Proceedings in Theoretical Computer Science 21, pp. 27–38, doi:10.4204/EPTCS.21.3.
  9. Christopher M. Poskitt & Detlef Plump (2012): Hoare-Style Verification of Graph Programs. Fundamenta Informaticae. To appear.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org