Pages that link to "Item:Q2117269"
From MaRDI portal
The following pages link to Verifying graph programs with monadic second-order logic (Q2117269):
Displaying 9 items.
- Reachability predicates for graph assertions (Q1708656) (← links)
- Monadic second-order incorrectness logic for GP 2 (Q2096431) (← links)
- Incorrectness logic for graph programs (Q2117260) (← links)
- Hoare-style verification of graph programs (Q2898467) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311128) (← links)
- (Q6198042) (← links)
- Specification and verification of a linear-time temporal logic for graph transformation (Q6535505) (← links)
- Mechanised DPO theory: uniqueness of derivations and Church-Rosser theorem (Q6535510) (← links)
- Formalising the double-pushout approach to graph transformation (Q6635513) (← links)