Skip to main content
Cornell University
Learn about arXiv becoming an independent nonprofit.
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arxiv logo > cs > arXiv:1912.09610v1

Help | Advanced Search

arXiv logo
Cornell University Logo

quick links

  • Login
  • Help Pages
  • About

Computer Science > Software Engineering

arXiv:1912.09610v1 (cs)
[Submitted on 20 Dec 2019]

Title:Rule-based Graph Repair

Authors:Christian Sandmann, Annegret Habel
View a PDF of the paper titled Rule-based Graph Repair, by Christian Sandmann and 1 other authors
View PDF
Abstract:Model repair is an essential topic in model-driven engineering. Since models are suitably formalized as graph-like structures, we consider the problem of rule-based graph repair: Given a rule set and a graph constraint, try to construct a graph program based on the given set of rules, such that the application to any graph yields a graph satisfying the graph constraint. We show the existence of repair programs for specific constraints, and show the existence of rule-based repair programs for specific constraints compatible with the rule set.
Comments: In Proceedings GCM 2019, arXiv:1912.08966
Subjects: Software Engineering (cs.SE)
Cite as: arXiv:1912.09610 [cs.SE]
  (or arXiv:1912.09610v1 [cs.SE] for this version)
  https://doi.org/10.48550/arXiv.1912.09610
arXiv-issued DOI via DataCite
Journal reference: EPTCS 309, 2019, pp. 87-104
Related DOI: https://doi.org/10.4204/EPTCS.309.5
DOI(s) linking to related resources

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Fri, 20 Dec 2019 01:41:19 UTC (65 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Rule-based Graph Repair, by Christian Sandmann and 1 other authors
  • View PDF
  • TeX Source
view license

Current browse context:

cs.SE
< prev   |   next >
new | recent | 2019-12
Change to browse by:
cs

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
Loading...

BibTeX formatted citation

Data provided by:

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status