Edinburgh Research Explorer

Consistency Checking of Re-engineered UML Class Diagrams via Datalog+/-

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish
Title of host publicationRule Technologies: Foundations, Tools, and Applications
Subtitle of host publication9th International Symposium, RuleML 2015, Berlin, Germany, August 2-5, 2015, Proceedings
EditorsNick Bassiliades, Georg Gottlob, Fariba Sadri, Adrian Paschke, Dumitru Roman
Place of PublicationCham
PublisherSpringer International Publishing
Pages35-53
Number of pages19
ISBN (Electronic)978-3-319-21542-6
ISBN (Print)978-3-319-21541-9
DOIs
Publication statusPublished - 2015

Publication series

NameLecture Notes in Computer Science
PublisherSpringer International Publishing
Volume9202
ISSN (Print)0302-9743

Abstract

UML class diagrams (UCDs) are a widely adopted formalism for modeling the intensional structure of a software system. Although UCDs are typically guiding the implementation of a system, it is common in practice that developers need to recover the class diagram from an implemented system. This process is known as reverse engineering. A fundamental property of reverse engineered (or simply re-engineered) UCDs is consistency, showing that the system is realizable in practice. In this work, we investigate the consistency of re-engineered UCDs, and we show is pspace-complete. The upper bound is obtained by exploiting algorithmic techniques developed for conjunctive query answering under guarded Datalog+/-, that is, a key member of the Datalog+/- family of KR languages, while the lower bound is obtained by simulating the behavior of a polynomial space Turing machine.

ID: 28083626