An algebraic framework for the transformation of attributed graphs
Term graph rewriting
Monadic second-order definable graph transductions: a survey
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools
Symbolic model checking with rich assertional languages
Theoretical Computer Science
Computer Networks
AGG: A Tool Environment for Algebraic Graph Transformation
AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
Progress on the State Explosion Problem in Model Checking
Informatics - 10 Years Back. 10 Years Ahead.
Approximating the Behaviour of Graph Transformation Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Automatic Verification of Parameterized Cache Coherence Protocols
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Unfolding semantics of graph transformation
Information and Computation
Formal Software Analysis Emerging Trends in Software Model Checking
FOSE '07 2007 Future of Software Engineering
Modeling and Verifying Graph Transformations in Proof Assistants
Electronic Notes in Theoretical Computer Science (ENTCS)
A framework for the verification of infinite-state graph transformation systems
Information and Computation
Towards the Verification of Attributed Graph Transformation Systems
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Formal Verification of Graph Grammars using Mathematical Induction
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards Attributed Graphs in Groove
Electronic Notes in Theoretical Computer Science (ENTCS)
Recognizable sets of graphs, hypergraphs and relational structures: a survey
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On the use of alloy to analyze graph transformation systems
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Specification patterns for properties over reachable states of graph grammars
SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
Hi-index | 0.00 |
Graph grammars may be used as specification technique for different kinds of systems, specially in situations in which states are complex structures that can be adequately modeled as graphs (possibly with an attribute data part) and in which the behavior involves a large amount of parallelism and can be described as reactions to stimuli that can be observed in the state of the system. The verification of properties of such systems is a difficult task due to many aspects: the systems in many situations involve an infinite number of states; states themselves are complex and large; there are a number of different computation possibilities due to the fact that rule applications may occur in parallel. There are already some approaches to verification of graph grammars based on model checking, but in these cases only finite state systems can be analyzed. Other approaches propose over- and/or under-approximations of the state space, but in this case it is not possible to check arbitrary properties. This work proposes a relational and logical approach to graph grammars that allows formal verification of systems using mathematical induction. We use relational structures to define graph grammars and first-order logic to model graph transformations. This approach allows proving properties of systems with infinite state spaces. In this paper we first consider the case of simple (typed) graphs, and then we extend the approach to the non-trivial case of attributed graphs, that are graphs in which values are associated to vertices. Attributed graph grammars are very interesting from a practical point of view, since it is possible to use variables and terms when specifying the behavior expressed by rules. These values (or terms) come from algebras specified as abstract data types. The use of attributed graphs gives the specifier a language that is more suitable for specification, merging the advantages of the graphical representation with the standard representation of classical data types. We show that attributes can be smoothly integrated in our representation of graph grammars, giving rise to a framework to reason about attributed graph grammars.