@InProceedings{brenas_et_al:LIPIcs.FSCD.2016.14,
  author =	{Brenas, Jon Ha\"{e}l and Echahed, Rachid and Strecker, Martin},
  title =	{{Proving Correctness of Logically Decorated Graph Rewriting Systems}},
  booktitle =	{1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)},
  pages =	{14:1--14:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-010-1},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{52},
  editor =	{Kesner, Delia and Pientka, Brigitte},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2016.14},
  URN =		{urn:nbn:de:0030-drops-59778},
  doi =		{10.4230/LIPIcs.FSCD.2016.14},
  annote =	{Keywords: Graph Rewriting, Hoare Logic,Combinatory PDL, Rewrite Strategies, Program Verification}
}