Proceedings of the 13th International ACM SIGPLAN Symposium on Principles and Practices of Declarative Programming 2011
DOI: 10.1145/2003476.2003482
|View full text |Cite
|
Sign up to set email alerts
|

Graph-transformation verification using monadic second-order logic

Abstract: This paper presents a new approach to solving the problem of verification of graph transformation, by proposing a new static verification algorithm for the Core UnCAL, the query algebra for graph-structured databases proposed by Bunemann et al. Given a graph transformation annotated with schema information, our algorithm statically verifies that any graph satisfying the input schema is converted by the transformation to a graph satisfying the output schema. We tackle the problem by first reformulating the sema… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
12
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
6
2
1

Relationship

2
7

Authors

Journals

citations
Cited by 19 publications
(13 citation statements)
references
References 32 publications
0
12
0
Order By: Relevance
“…Eg., nested collections cannot be represented. Translations from model transformation languages to different formalisms have also been used to perform termination analysis [50,46], proof of syntactic correctness [23], counterexample generation [13] and proof of semantic preservation [40]. Table 12 summarises such approaches.…”
Section: Related Workmentioning
confidence: 99%
“…Eg., nested collections cannot be represented. Translations from model transformation languages to different formalisms have also been used to perform termination analysis [50,46], proof of syntactic correctness [23], counterexample generation [13] and proof of semantic preservation [40]. Table 12 summarises such approaches.…”
Section: Related Workmentioning
confidence: 99%
“…There are a couple of approaches that address partial, Hoare-style correctness of model transformation with respect to metamodel constraints as transformation pre-and postconditions. Inaba et al automatically infer schema (i.e., metamodel) conformance for transformations based on the UnCAL query language using the MONA solver [15]. The schema expressiveness in this approach is more restricted than OCL and describes only the typing of the graph.…”
Section: Related Workmentioning
confidence: 99%
“…Anastasakis et al [3] and Baresi and Spoletini [5] use relational logic and the Alloy analyzer to check for inconsistencies in a transformation. Inaba et al [19] verify the typing of transformations with respect to a metamodel using second-order monadic logic and the MONA solver. Troya and Vallecillo [34] define an encoding of ATL in rewriting logic, that can be used to check the possible executions of a transformation in Maude.…”
Section: Related Workmentioning
confidence: 99%