Verifying Monadic Second-Order Properties of Graph Programs

DOI10.1007/978-3-319-09108-2_3zbMath1425.68080arXiv1405.5927OpenAlexW3105316458MaRDI QIDQ3192221

Christopher M. Poskitt, Detlef Plump

Publication date: 26 September 2014

Published in: Graph Transformation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.5927

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (12)

Theorem proving graph grammars with attributes and negative application conditions ⋮ Ensuring Correctness of Model Transformations While Remaining Decidable ⋮ On the Operationalization of Graph Queries with Generalized Discrimination Networks ⋮ Formal Verification of Invariants for Attributed Graph Transformation Systems Based on Nested Attributed Graph Conditions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A navigational logic for reasoning about graph properties ⋮ Institutions for navigational logics for graphical structures ⋮ Monadic second-order incorrectness logic for GP 2 ⋮ Incorrectness logic for graph programs ⋮ Verifying graph programs with monadic second-order logic

This page was built for publication: Verifying Monadic Second-Order Properties of Graph Programs