Hoare-Style Verification of Graph Programs

  title={Hoare-Style Verification of Graph Programs},
  author={Christopher M. Poskitt and Detlef Plump},
  journal={Fundam. Inform.},
GP (for Graph Programs) is an experimental nondeterministi c programming language for solving problems on graphs and graph-like structures. T he language is based on graph transformation rules, allowing visual programming at a high leve l of abstraction. In particular, GP frees programmers from dealing with low-level data structures. I n this paper, we… CONTINUE READING