A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
k-Inductive Invariant Checking for Graph Transformation Systems
[chapter]
2017
Lecture Notes in Computer Science
We prove the approach's correctness and demonstrate its applicability by means of several examples evaluated with a prototypical implementation of our algorithm. While our technique takes care of the inductive step (verifying the k-inductive invariant), the base of induction for traces of length k − 1 from an initial graph is established with the model checker GROOVE [9]. This report is organized as follows: In Section 2, we reintroduce the necessary foundations and our formal model. Section 3
doi:10.1007/978-3-319-61470-0_9
fatcat:jzlax4qgwvdfdpifrwkvlnvt3y