AuRUS: explaining the validation of UML/OCL conceptual schemas

Abstract

Abstract:The validation and the verification of conceptual schemas have attracted a lot of interest during the last years, and several tools have been developed to automate this process as much as possible. This is achieved, in general, by assessing whether the schema satisfies different kinds of desirable properties which ensure that the schema is correct. In this paper we describe AuRUS, a tool we have developed to analyze UML/OCL conceptual schemas and to explain their (in)correctness. When a property is satisfied, AuRUS provides a sample instantiation of the schema showing a particular situation where the property holds. When it is not, AuRUS provides an explanation for such unsatisfiability, i.e., a set of integrity constraints which is in contradiction with the property.

An Ontology-Based Framework for Describing Discoverable Data Services

“…Then, we have described all mentioned dataservices in terms of it 1 , using the constructions specified in Section 4. Then, we have used the AuRUS [5] UML/OCL reasoner for evaluating the execution times for: 1) checking the correctness of the descriptions, 2) matching data-services with data-requests. We have run all experiments over a Windows 8 in an Intel i7-4710HQ up to 3.5GHz machine with 8GB of RAM.…”

“…Clearly, if no such real-world domain I exists, this means that this data-service is not outcoming any output from any input, which would mean that such data-service is useless. Checking relationship liveliness is a well-known ontology reasoning task [4,5].…”

“…Ensuring that two equal instances of parameters cannot describe (i.e., be associated to) the same object is a reasoning task that can be solved by many current UML/OCL reasoning tools [8,9,10,5].…”

“…E.g., we could use Alloy [8], USE [9], UMLtoCSP [10], or AuRUS [5]. Moreover, these tools are capable of computing the counterexample I that proves when a data-service would compute an undesired output for the data-request.…”

“…Moreover, we also have that the problem of data-service/request matching is reduced to that of ontology reasoning. More precisely, to relation subsumption which is a very well-known and studied problem in the field of automated ontology reasoning [4,5].…”