Proving correctness of logically decorated graph rewriting systems

DOI10.4230/LIPICS.FSCD.2016.14MaRDI QIDQ5369479zbMATH OpenFDO

Authors Jon Haël Brenas, Rachid Echahed, Martin Strecker

Publication date 17 October 2017

Full work available at URL https://doi.org/10.4230/LIPICS.FSCD.2016.14

zbMATH Keywords

combinatory PDLgraph rewritingHoare logicprogram verificationrewrite strategies

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Recommendations

• Verifying graph transformation systems with description logics
• Development of Correct Graph Transformation Systems
• A Hoare calculus for graph programs
• Verifying a behavioural logic for graph transformation systems
• Publication:4890715

Cited in

(4)

• Verifying graph transformation systems with description logics
• Incorrectness logic for graph programs
• Ensuring correctness of model transformations while remaining decidable
• Development of Correct Graph Transformation Systems

This page was built for publication: Proving correctness of logically decorated graph rewriting systems

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