A Hoare calculus for graph programs

• المؤلفون الرئيسيون: POSKITT, Christopher M., PLUMP, Detlef
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2010
• الموضوعات: Inference Rule; Proof System; Graph Transformation; Graph Program; Partial Correctness; Theory and Algorithms
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/sis_research/4918; https://ink.library.smu.edu.sg/context/sis_research/article/5921/viewcontent/PoskittPlump.ICGT.2010.pdf
• المؤسسة: Singapore Management University

We present Hoare-style axiom schemata and inference rules for verifying the partial correctness of programs in the graph programming language GP. The pre- and postconditions of this calculus are the nested conditions of Habel, Pennemann and Rensink, extended with expressions for labels in order to d...