k-Inductive Invariant Checking for Graph Transformation Systems

DOI10.1007/978-3-319-61470-0_9zbMath1425.68160OpenAlexW2718727420MaRDI QIDQ4972013

Johannes Dyck, Holger Giese

Publication date: 22 November 2019

Published in: Graph Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-61470-0_9

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items (6)

Graph Consistency as a Graduated Property ⋮ Formal Verification of Invariants for Attributed Graph Transformation Systems Based on Nested Attributed Graph Conditions ⋮ Optimistic and Pessimistic On-the-fly Analysis for Metric Temporal Graph Logic ⋮ Invariant Analysis for Multi-agent Graph Transformation Systems Using k-Induction ⋮ Compositional analysis of probabilistic timed graph transformation systems ⋮ Constructing optimized constraint-preserving application conditions for model transformation rules

This page was built for publication: k-Inductive Invariant Checking for Graph Transformation Systems