A Hoare calculus for graph programs

DOI10.1007/978-3-642-15928-2_10MaRDI QIDQ4931309zbMATH OpenOpenAlexFDO

Authors Christopher M. Poskitt, Detlef Plump

Publication date 4 October 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://ink.library.smu.edu.sg/sis_research/4918

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)

Recommendations

• Hoare-style verification of graph programs
• Verifying graph programs with monadic second-order logic
• Verifying monadic second-order properties of graph programs
• A Hoare-like calculus using the \(\mathrm{SROIQ}^{\sigma }\) logic on transformations of graphs
• Reasoning about graph programs

Cited in

(10)

• Ensuring correctness of model transformations while remaining decidable
• Proving correctness of logically decorated graph rewriting systems
• Hoare-style verification of graph programs
• A Hoare-like calculus using the \(\mathrm{SROIQ}^{\sigma }\) logic on transformations of graphs
• A strict constrained superposition calculus for graphs
• scientific article; zbMATH DE number 7456057 (Why is no real title available?)
• Reasoning about graph programs
• Graph Transformations
• Verifying monadic second-order properties of graph programs
• Verifying graph programs with monadic second-order logic

Describes a project that uses

Uses Software

• GrGen

This page was built for publication: A Hoare calculus for graph programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4931309)