Inductive Invariant Checking with Partial Negative Application Conditions

DOI10.1007/978-3-319-21145-9_15zbMath1321.68329OpenAlexW951772279MaRDI QIDQ2947222

Johannes Dyck, Holger Giese

Publication date: 22 September 2015

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

Full work available at URL: https://nbn-resolving.org/urn:nbn:de:kobv:517-opus4-77748

Mathematics Subject Classification ID

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

Related Items (4)

Inductive Invariant Checking with Partial Negative Application Conditions ⋮ Formal Verification of Invariants for Attributed Graph Transformation Systems Based on Nested Attributed Graph Conditions ⋮ A tale of two graph models: a case study in wireless sensor networks ⋮ Constructing optimized constraint-preserving application conditions for model transformation rules

Cites Work

• Unnamed Item
• Fundamentals of algebraic graph transformation
• Towards Automatic Verification of Behavior Preservation for Model Transformation via Invariant Checking
• Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking
• Inductive Invariant Checking with Partial Negative Application Conditions
• A General Framework for Well-Structured Graph Transformation Systems
• Correctness of high-level transformation systems relative to nested conditions
• -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation

This page was built for publication: Inductive Invariant Checking with Partial Negative Application Conditions