<bibliography>
 <citation type="article" key="Apt84">
  <author>Krzysztof R. <surname>Apt</surname></author>
  <year>1984</year>
  <title>Ten Years of Hoare's Logic: A Survey. Part II: Nondeterminism</title>
  <journal>Theoretical Computer Science</journal>
  <volume>28</volume>
  <pages>83&#8211;109</pages>
  <doi>10.1016/0304-3975(83)90066-X</doi>
 </citation>
 <citation type="book" key="BaaderNipkow98a">
  <author>Franz <surname>Baader</surname></author>
  <author>Tobias <surname>Nipkow</surname></author>
  <year>1998</year>
  <title>Term Rewriting and All That</title>
  <publisher>Cambridge University Press</publisher>
  <doi>10.1017/cbo9781139172752</doi>
 </citation>
 <citation type="phdthesis" key="Bak15a">
  <author>Christopher <surname>Bak</surname></author>
  <year>2015</year>
  <title>GP+.1667em2: Efficient Implementation of a Graph Programming Language</title>
  <school>Department of Computer Science, University of York, UK</school>
  <url>https://etheses.whiterose.ac.uk/12586/</url>
 </citation>
 <citation type="inproceedings" key="Bak-Plump16a">
  <author>Christopher <surname>Bak</surname></author>
  <author>Detlef <surname>Plump</surname></author>
  <year>2016</year>
  <title>Compiling Graph Programs to C</title>
  <booktitle>Proc. International Conference on Graph Transformation (ICGT 2016)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>9761</volume>
  <publisher>Springer</publisher>
  <pages>102&#8211;117</pages>
  <doi>10.1007/978-3-319-40530-8_7</doi>
 </citation>
 <citation type="book" key="BookOtto93">
  <author>Ronald V. <surname>Book</surname></author>
  <author>Friedrich <surname>Otto</surname></author>
  <year>1993</year>
  <title>String-Rewriting Systems</title>
  <publisher>Springer</publisher>
  <doi>10.1007/978-1-4613-9771-7</doi>
 </citation>
 <citation type="article" key="Campbell-Courtehoute-Plump20a">
  <author>Graham <surname>Campbell</surname></author>
  <author>Brian <surname>Courtehoute</surname></author>
  <author>Detlef <surname>Plump</surname></author>
  <year>2020</year>
  <title>Fast Rule-Based Graph Programs</title>
  <journal>ArXiv e-prints</journal>
  <volume>arXiv:2012.11394</volume>
  <url>https://arxiv.org/abs/2012.11394</url>
  <note>47 pages</note>
 </citation>
 <citation type="book" key="CormenLeisersonRivestStein09">
  <author>Thomas H. <surname>Cormen</surname></author>
  <author>Charles E. <surname>Leiserson</surname></author>
  <author>Ronald L. <surname>Rivest</surname></author>
  <author>Clifford <surname>Stein</surname></author>
  <year>2009</year>
  <title>Introduction to Algorithms</title>
  <edition>3</edition>
  <publisher>The MIT Press</publisher>
 </citation>
 <citation type="book" key="Dijkstra97">
  <author>Edsger W. <surname>Dijkstra</surname></author>
  <year>1997</year>
  <title>A Discipline of Programming</title>
  <edition>1st</edition>
  <publisher>Prentice Hall PTR</publisher>
 </citation>
 <citation type="book" key="Ehrig-Ehrig-Prange-Taentzer06a">
  <author>Hartmut <surname>Ehrig</surname></author>
  <author>Karsten <surname>Ehrig</surname></author>
  <author>Ulrike <surname>Prange</surname></author>
  <author>Gabriele <surname>Taentzer</surname></author>
  <year>2006</year>
  <title>Fundamentals of Algebraic Graph Transformation</title>
  <series>Monographs in Theoretical Computer Science</series>
  <publisher>Springer</publisher>
  <doi>10.1007/3-540-31188-2_3</doi>
 </citation>
 <citation type="article" key="FokkinkVu03">
  <author>Wan <surname>Fokkink</surname></author>
  <author>Thuy <surname>Vu</surname></author>
  <year>2003</year>
  <title>Structural Operational Semantics and Bounded Nondeterminism</title>
  <journal>Acta Informatica</journal>
  <volume>39</volume>
  <pages>501&#8211;516</pages>
  <doi>10.1007/s00236-003-0111-1</doi>
 </citation>
 <citation type="inproceedings" key="Hristakiev-Plump16a">
  <author>Ivaylo <surname>Hristakiev</surname></author>
  <author>Detlef <surname>Plump</surname></author>
  <year>2016</year>
  <title>Attributed Graph Transformation via Rule Schemata: Church-Rosser Theorem</title>
  <booktitle>Software Technologies: Applications and Foundations &#8211; STAF 2016 Collocated Workshops, Revised Selected Papers</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>9946</volume>
  <publisher>Springer</publisher>
  <pages>145&#8211;160</pages>
  <doi>10.1007/978-3-319-50230-4_11</doi>
 </citation>
 <citation type="article" key="Konig27">
  <author>D&#233;nes <surname>K&#246;nig</surname></author>
  <year>1927</year>
  <title>&#220;ber eine Schlussweise aus dem Endlichen ins Unendliche</title>
  <journal>Acta Sci. Math.(Szeged)</journal>
  <volume>3</volume>
  <number>2-3</number>
  <pages>121&#8211;130</pages>
 </citation>
 <citation type="article" key="Moser20">
  <author>Georg <surname>Moser</surname></author>
  <author>Manuel <surname>Schneckenreither</surname></author>
  <year>2020</year>
  <title>Automated amortised resource analysis for term rewrite systems</title>
  <journal>Science of Computer Programming</journal>
  <volume>185</volume>
  <pages>102306</pages>
  <doi>10.1016/j.scico.2019.102306</doi>
 </citation>
 <citation type="book" key="NielsonNielson07">
  <author>Hanne Riis <surname>Nielson</surname></author>
  <author>Flemming <surname>Nielson</surname></author>
  <year>2007</year>
  <title>Semantics with Applications: An Appetizer</title>
  <publisher>Springer</publisher>
  <doi>10.1007/978-1-84628-692-6</doi>
 </citation>
 <citation type="article" key="Plotkin04a">
  <author>Gordon D. <surname>Plotkin</surname></author>
  <year>2004</year>
  <title>A Structural Approach to Operational Semantics</title>
  <journal>Journal of Logic and Algebraic Programming</journal>
  <volume>60&#8211;61</volume>
  <pages>17&#8211;139</pages>
  <doi>10.1016/j.jlap.2004.05.001</doi>
 </citation>
 <citation type="inproceedings" key="Plump12a">
  <author>Detlef <surname>Plump</surname></author>
  <year>2012</year>
  <title>The Design of GP+.1667em2</title>
  <booktitle>Proc. 10th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2011)</booktitle>
  <series>Electronic Proceedings in Theoretical Computer Science</series>
  <volume>82</volume>
  <pages>1&#8211;16</pages>
  <doi>10.4204/EPTCS.82.1</doi>
 </citation>
 <citation type="article" key="Plump17a">
  <author>Detlef <surname>Plump</surname></author>
  <year>2017</year>
  <title>From Imperative to Rule-based Graph Programs</title>
  <journal>Journal of Logical and Algebraic Methods in Programming</journal>
  <volume>88</volume>
  <pages>154&#8211;173</pages>
  <doi>10.1016/j.jlamp.2016.12.001</doi>
 </citation>
 <citation type="book" key="Reynolds98a">
  <author>John C <surname>Reynolds</surname></author>
  <year>1998</year>
  <title>Theories of Programming Languages</title>
  <publisher>Cambridge University Press</publisher>
  <doi>10.1017/cbo9780511626364</doi>
 </citation>
 <citation type="article" key="SondergaardSestoft92">
  <author>H. <surname>S\IeC&#x00f8; ndergaard</surname></author>
  <author>P. <surname>Sestoft</surname></author>
  <year>1992</year>
  <title>Non-determinism in Functional Languages</title>
  <journal>The Computer Journal</journal>
  <volume>35</volume>
  <number>5</number>
  <pages>514&#8211;523</pages>
  <doi>10.1093/comjnl/35.5.514</doi>
 </citation>
</bibliography>
