Skip to main content
Conference ProceedingsOPEN ACCESS

Decidable reasoning in UML schemas with constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5074 LNCS 281-295
DOI: 10.1007/978-3-540-69534-9_23
22Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we propose an approach to reason on UML schemas with OCL constraints. We provide a set of theorems to determine that a schema does not have any infinite model and then provide a decidable method that, given a schema of this kind, efficiently checks whether it satisfies a set of desirable properties such as schema satisfiability and class or association liveliness. © 2008 Springer-Verlag Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Queralt, A., & Teniente, E. (2008). Decidable reasoning in UML schemas with constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5074 LNCS, pp. 281–295). https://doi.org/10.1007/978-3-540-69534-9_23

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