k-Inductive Invariant Checking for Graph Transformation Systems
Authors:
- 21 June 2017
- book chapter
- Published by Springer Nature
- p. 142-158
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Inductive Invariant Checking with Partial Negative Application Conditions2015
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamationMathematical Structures in Computer Science, 2014
- A General Framework for Well-Structured Graph Transformation SystemsLecture Notes in Computer Science, 2014
- Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking2012
- Modelling and analysis using GROOVEInternational Journal on Software Tools for Technology Transfer, 2011
- Software Verification Using k-Induction2011
- Correctness of high-level transformation systems relative to nested conditionsMathematical Structures in Computer Science, 2009
- Augur 2 — A New Version of a Tool for the Analysis of Graph Transformation SystemsElectronic Notes in Theoretical Computer Science, 2008
- Symbolic invariant verification for systems with dynamic structural adaptation2006
- CheckVML: A Tool for Model Checking Visual Modeling Languages2003