Verifying graph programs with monadic second-order logic

DOI10.1007/978-3-030-78946-6_13zbMath1492.68043OpenAlexW3173413130MaRDI QIDQ2117269

Gia S. Wulandari, Detlef Plump

Publication date: 21 March 2022

Full work available at URL: https://eprints.whiterose.ac.uk/176053/1/WulandariPlump.ICGT.21.pdf

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) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Unnamed Item ⋮ Monadic second-order incorrectness logic for GP 2

Uses Software

• Coq
• GP 2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From imperative to rule-based graph programs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Hoare-Style Verification of Graph Programs
• Concrete Semantics
• Verifying Monadic Second-Order Properties of Graph Programs
• Correctness of high-level transformation systems relative to nested conditions
• The Graph Programming Language GP

This page was built for publication: Verifying graph programs with monadic second-order logic