{"paper":{"title":"On the Verification of Logically Decorated Graph Transformations","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jon Ha\\\"el Brenas, Martin Strecker, Rachid Echahed","submitted_at":"2018-03-07T17:16:01Z","abstract_excerpt":"We address the problem of reasoning on graph transformations featuring actions such as \\emph{addition} and \\emph{deletion} of nodes and edges, node \\emph{merging} and \\emph{cloning}, node or edge \\emph{labelling} and edge \\emph{redirection}. First, we introduce the considered graph rewrite systems which are parameterized by a given logic $\\mathcal{L}$. Formulas of $\\mathcal{L}$ are used to label graph nodes and edges. In a second step, we tackle the problem of formal verification of the considered rewrite systems by using a Hoare-like weakest precondition calculus. It acts on triples of the fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02776","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}