Petri nets: an introduction
An algebraic framework for the transformation of attributed graphs
Term graph rewriting
Algebraic high level nets: Petri nets revisited
Selected papers from 9th workshop on Specification of abstract data types : recent trends in data type specification: recent trends in data type specification
ACM Computing Surveys (CSUR)
A Static Analysis Technique for Graph Transformation Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Workshop on Graph Transformation and Visual Modeling Techniques
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract)
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verification of Random Graph Transformation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Augur 2 --- A New Version of a Tool for the Analysis of Graph Transformation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Static Analysis of Dynamic Communication Systems by Partner Abstraction
SAS '07 Proceedings of the 14th international Symposium on Static Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
Coloured Petri nets: status and outlook
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Counterexample-Guided abstraction refinement for the analysis of graph transformation systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A hoare calculus for graph programs
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Verification of graph grammars using a logical approach
Science of Computer Programming
Hoare-Style Verification of Graph Programs
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
Verification of graph programs
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Modeling and verifying dynamic communication structures based on graph transformations
Computer Science - Research and Development
| Hi-index | 0.00 |
We describe an approach for the verification of attributed graph transformation systems (AGTS). AGTSs are graph transformation systems where graphs are labelled over an algebra. We base our verification procedure on so-called approximated unfoldings combined with counterexample-guided abstraction refinement. Both techniques were originally developed for non-attributed systems. With respect to refinement we focus especially on detecting whether the spurious counterexample is caused by structural over-approximation or by an abstraction of the attributes which is too coarse. The technique is implemented in the verification tool Augur 2and a leader election protocol has been successfully verified.