Hoare-Style Verification of Graph Programs
Christopher M. Poskitt, Detlef Plump · Fundamenta Informaticae · 2012
GP (for Graph Programs) is an experimental nondeterministic programming language for solving problems on graphs and graph-like structures. The language is based on graph transformation rules, allowing visual programming at a high level of abstraction