Verifying Monadic Second-Order Properties of Graph Programs

  title={Verifying Monadic Second-Order Properties of Graph Programs},
  author={Christopher M. Poskitt and Detlef Plump},
The core challenge in a Hoareor Dijkstra-style proof system for graph programs is in defining a weakest liberal precondition construction with respect to a rule and a postcondition. Previous work addressing this has focused on assertion languages for first-order properties, which are unable to express important global properties of graphs such as acyclicity, connectedness, or existence of paths. In this paper, we extend the nested graph conditions of Habel, Pennemann, and Rensink to make them… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS


Publications citing this paper.

Similar Papers

Loading similar papers…