Skip to main content
Conference Proceedings

Graph repair by graph programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2018) 11176 LNCS 431-446
DOI: 10.1007/978-3-030-04771-9_31
11Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Model repair is an essential topic in model-driven engineering. We consider the problem of graph repair: Given a graph constraint, we try to construct a graph program, such that the application to any graph yields a graph satisfying the graph constraint. We show the existence of terminating repair programs for a number of satisfiable constraints.

Cite

CITATION STYLE

APA

Habel, A., & Sandmann, C. (2018). Graph repair by graph programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11176 LNCS, pp. 431–446). Springer Verlag. https://doi.org/10.1007/978-3-030-04771-9_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free