Towards the Verification of Attributed Graph Transformation Systems

König, Barbara; Kozioura, Vitali

doi:10.1007/978-3-540-87405-8_21

Cited by 17 publications

(12 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our approach is inspired by both [31] and [32], and provides a framework for verification of a large class of graph grammars including attributes, which is a class that is only partially covered by model-checking techniques.…”

Section: B Theorem Provingmentioning

confidence: 99%

Specification and Analysis of Concurrent Systems Using Object-Based Graph Grammars

Ribeiro

Dotti

2011

2011 Workshop-School on Theoretical Computer Science

View full text Add to dashboard Cite

Building correct software systems is commonly accepted as both important and difficult. To achieve this, one has to address two basic issues: (i) offer suitable abstractions to formally specify specific classes of systems; (ii) allow the formal analysis of systems built using those abstractions. In this paper we review our results in this direction: we have proposed Object-Based Graph-Grammars (OBGGs) as a suitable set of abstractions to model concurrent, distributed, message passing and object-based based systems, coping with (i); and, coping with (ii), a set of transformations for OBGGs was proposed allowing one to employ several analysis methods, such as: model checking both functional and real-time properties, quantitative analysis using analytical methods, and verification through theorem proving.

show abstract

Section: B Theorem Provingmentioning

confidence: 99%

Specification and Analysis of Concurrent Systems Using Object-Based Graph Grammars

Ribeiro

Dotti

2011

2011 Workshop-School on Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…In recent years, a number of verification approaches have emerged which typically focus on sets of graph transformation rules or graph grammars [32,4,20,6,10,19].…”

Section: Introductionmentioning

confidence: 99%

Verification of Graph Programs

Poskitt

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. GP (for Graph Programs) is an experimental nondeterministic programming language for solving problems on graphs and graph-like structures. The language is based on graph transformation rules, allowing visual programming at a high level of abstraction. In particular, GP frees programmers from dealing with low-level data structures. In this paper, we present a Hoare-style proof system for verifying the partial correctness of (a subset of) graph programs. The pre-and postconditions of the calculus are nested graph conditions with expressions, a formalism for specifying both structural graph properties and properties of labels. We show that our proof system is sound with respect to GP's operational semantics and give examples of its use.

show abstract

“…Applications to the semantics of languages and the analysis of systems naturally raise the question of how to formally verify properties of graph transformation systems. In recent years, a number of verification approaches have emerged which typically focus on sets of graph transformation rules or graph grammars [32,4,20,6,10,19].…”

Section: Introductionmentioning

confidence: 99%

Hoare-Style Verification of Graph Programs

Poskitt

Plump

2012

Fundamenta Informaticae

View full text Add to dashboard Cite

GP (for Graph Programs) is an experimental nondeterministic programming language for solving problems on graphs and graph-like structures. The language is based on graph transformation rules, allowing visual programming at a high level of abstraction. In particular, GP frees programmers from dealing with low-level data structures. In this paper, we present a Hoare-style proof system for verifying the partial correctness of (a subset of) graph programs. The pre-and postconditions of the calculus are nested graph conditions with expressions, a formalism for specifying both structural graph properties and properties of labels. We show that our proof system is sound with respect to GP's operational semantics and give examples of its use. * This author is grateful to be supported by a scholarship of the Engineering and Physical Sciences Research Council. 1 ⊕ Z t α 2 where ⊕ Z is the integer operation represented by ⊕. Finally, if e has the form t e 1 with t ∈ Term ∪ String and e 1 ∈ Exp, then e α = t α e α 1 (the concatenation of the sequences t α and e α 1 ). Given a graph G in G(Exp) and an assignment α that is well-typed for all expressions in G, we write G α for the graph in G(L) that is obtained from G by replacing each label e with e α

show abstract

Towards the Verification of Attributed Graph Transformation Systems

Cited by 17 publications

References 18 publications

Specification and Analysis of Concurrent Systems Using Object-Based Graph Grammars

Specification and Analysis of Concurrent Systems Using Object-Based Graph Grammars

Verification of Graph Programs

Hoare-Style Verification of Graph Programs

Contact Info

Product

Resources

About