Querying UML class diagrams
Calì, Andrea and Gottlob, G. and Orsi, G. and Pieris, A. (2012) Querying UML class diagrams. In: Birkedal, L. (ed.) Foundations of Software Science and Computational Structures. Lecture Notes in Computer Science 7213. Berlin, Germany: Springer, pp. 1-25. ISBN 9783642287282.
Abstract
UML Class Diagrams (UCDs) are the best known class-based formalism for conceptual modeling. They are used by software engineers to model the intensional structure of a system in terms of classes, attributes and operations, and to express constraints that must hold for every instance of the system. Reasoning over UCDs is of paramount importance in design, validation, maintenance and system analysis; however, for medium and large software projects, reasoning over UCDs may be impractical. Query answering, in particular, can be used to verify whether a (possibly incomplete) instance of the system modeled by the UCD, i.e., a snapshot, enjoys a certain property. In this work, we study the problem of querying UCD instances, and we relate it to query answering under guarded Datalog±, that is, a powerful Datalog-based language for ontological modeling. We present an expressive and meaningful class of UCDs, named Lean UCD, under which conjunctive query answering is tractable in the size of the instances.
Metadata
Item Type: | Book Section |
---|---|
Additional Information: | 15th International Conference, FOSSACS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 – April 1, 2012. Proceedings |
School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
Research Centres and Institutes: | Birkbeck Knowledge Lab |
Depositing User: | Sarah Hall |
Date Deposited: | 26 Apr 2013 13:38 |
Last Modified: | 09 Aug 2023 12:32 |
URI: | https://eprints.bbk.ac.uk/id/eprint/6494 |
Statistics
Additional statistics are available via IRStats2.