Output details
11 - Computer Science and Informatics
University of York
Return to search
Output 0 of 0 in the submission
Article title
Hoare-Style Verification of Graph Programs
Type
D - Journal article
Title of journal
Fundamenta Informaticae
Article number
-
Volume number
118
Issue number
1-2
First page of article
135
ISSN of journal
0169-2968
Year of publication
2012
URL
-
Number of additional authors
1
Additional information
<10>This paper (and its conference version) present the first Hoare-logic approach to the verification of graph transformation systems and graph programs. A central result is the soundness of the given proof rules with respect to the operational semantics of graph programs in the language GP. Our approach to verification is also cited by different groups in the model-transformation community, see for example the papers On Verifying ATL Transformations Using off-the-shelf SMT Solvers (MODELS 2012, LNCS 7590) and Graph Transformations for MDE, Adaptation, and Models at Runtime (Formal Methods for Model-Driven Engineering 2012, LNCS 7320).
Interdisciplinary
-
Cross-referral requested
-
Research group
C - Programming Languages and Systems
Citation count
2
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
