The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
A Static Analysis Technique for Graph Transformation Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Approximating the Behaviour of Graph Transformation Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Expressiveness and complexity of graph logic
Information and Computation
A Modal-Logic Based Graph Abstraction
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
A logic for analyzing abstractions of graph transformation systems
SAS'03 Proceedings of the 10th international conference on Static analysis
A temporal graph logic for verification of graph transformation systems
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
Counterpart semantics for a second-order µ-calculus
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Modelling and analysis using GROOVE
International Journal on Software Tools for Technology Transfer (STTT)
Model checking quantified computation tree logic
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
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
Counterpart Semantics for a Second-Order μ-Calculus
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
Exploiting over- and under-approximations for infinite-state counterpart models
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
| Hi-index | 0.00 |
System specification formalisms should come with suitable property specification languages and effective verification tools. We sketch a framework for the verification of quantified temporal properties of systems with dynamically evolving structure. We consider visual specification formalisms like graph transformation systems (GTS) where program states are modelled as graphs, and the program behaviour is specified by graph transformation rules. The state space of a GTS can be represented as a graph transition system (GTrS), i.e. a transition system with states and transitions labelled, respectively, with a graph, and with a partial morphism representing the evolution of state components. Unfortunately, GTrSs are prohibitively large or infinite even for simple systems, making verification intractable and hence calling for appropriate abstraction techniques.