Verification of graph grammars using a logical approach

Costa, Sérgio Ely Valadão Gigante de Andrade; Ribeiro, Leila

doi:10.1016/j.scico.2010.02.006

Cited by 15 publications

(1 citation statement)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since we are allowing non-injective rules, great part of the theory of graph transformations can not be used directly and we need to investigate which results may hold. Concerning verification of properties, we intent to extend the analysis of graph transformations using theorem provers [8] to attributed SqPO-rewriting.…”

Section: Resultsmentioning

confidence: 99%

Transformation of Attributed Structures with Cloning

Duval

Echahed

Prost

et al. 2014

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. Copying, or cloning, is a basic operation used in the specification of many applications in computer science. However, when dealing with complex structures, like graphs, cloning is not a straightforward operation since a copy of a single vertex may involve (implicitly) copying many edges. Therefore, most graph transformation approaches forbid the possibility of cloning. We tackle this problem by providing a framework for graph transformations with cloning. We use attributed graphs and allow rules to change attributes. These two features (cloning/changing attributes) together give rise to a powerful formal specification approach. In order to handle different kinds of graphs and attributes, we first define the notion of attributed structures in an abstract way. Then we generalise the sesqui-pushout approach of graph transformation in the proposed general framework and give appropriate conditions under which attributed structures can be transformed. Finally, we instantiate our general framework with different examples, showing that many structures can be handled and that the proposed framework allows one to specify complex operations in a natural way.

show abstract

Section: Resultsmentioning

confidence: 99%