Hoare-Style Verification of Graph Programs
From MaRDI portal
Publication:2898467
DOI10.3233/FI-2012-708zbMath1284.68333OpenAlexW1502422810MaRDI QIDQ2898467
Christopher M. Poskitt, Detlef Plump
Publication date: 11 July 2012
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2012-708
Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Theorem proving graph grammars with attributes and negative application conditions ⋮ Preserving consistency in geometric modeling with graph transformations ⋮ Interactive and automated proofs for graph transformations ⋮ Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ From imperative to rule-based graph programs ⋮ Juggrnaut: using graph grammars for abstracting unbounded heap structures ⋮ Monadic second-order incorrectness logic for GP 2 ⋮ Incorrectness logic for graph programs ⋮ Verifying graph programs with monadic second-order logic
Uses Software
This page was built for publication: Hoare-Style Verification of Graph Programs
