Towards Attributed Graphs in Groove

Kastenberg, Harmen

doi:10.1016/j.entcs.2005.03.030

Cited by 16 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, attributes are supported in the form of directed edges to value nodes. [3] Rules enable the manipulation of graphs. Main rule features are: Readers: Edges and nodes that must be present for a rule to be applicable, and are unaffected by the transformation.…”

Section: Introductionmentioning

confidence: 99%

Class Diagram Restructuring with GROOVE

Smid

Rensink

2013

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 99%

Class Diagram Restructuring with GROOVE

Smid

Rensink

2013

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…The core message is that since our attributed graphs are specified entirely in terms of graph structures, abstractions can be defined as (non-injective) graph morphisms. This chapter extends the ideas originally presented in [110].…”

Section: Outline Of the Thesismentioning

confidence: 51%

Graph-based software specification and verification

Kastenberg¹

Self Cite

View full text Add to dashboard Cite

“…However, there seems to be only a small amount of work on the verification and over-approximation of attributed graph transformation systems. We are currently aware of attributes in the tool Groove [13] for the verification of finite-state graph transformation systems. Furthermore AGTSs could be transformed into the input language of more conventional model checkers that do support attributes.…”

Section: Discussionmentioning

confidence: 99%

Towards the Verification of Attributed Graph Transformation Systems

König

Kozioura

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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 2 and a leader election protocol has been successfully verified.

show abstract

Towards Attributed Graphs in Groove

Cited by 16 publications

References 8 publications

Class Diagram Restructuring with GROOVE

Class Diagram Restructuring with GROOVE

Graph-based software specification and verification

Towards the Verification of Attributed Graph Transformation Systems

Contact Info

Product

Resources

About