Decidable Reasoning in UML Schemas with Constraints

  • Authors:
  • Anna Queralt;Ernest Teniente

  • Affiliations:
  • Universitat Politècnica de Catalunya,;Universitat Politècnica de Catalunya,

  • Venue:
  • CAiSE '08 Proceedings of the 20th international conference on Advanced Information Systems Engineering
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.