Filmstripping and unrolling: A comparison of verification approaches for UML and OCL behavioral models

22Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Guaranteeing the essential properties of a system early in the design process is an important as well as challenging task. Modeling languages such as the UML allow for a formal description of structure and behavior by employing OCL class invariants and operation pre- and postconditions. This enables the verification of a system description prior to implementation. For this purpose, first approaches have recently been put forward. In particular, solutions relying on the deductive power of constraint solvers are promising. Here, complementary approaches of how to formulate and transform respective UML and OCL verification tasks into corresponding solver tasks have been proposed. However, the resulting methods have not yet been compared to each other. In this contribution, we consider two verification approaches for UML and OCL behavioral models and compare their methods and the respective workflows with each other. By this, a better understanding of the advantages and disadvantages of these verification methods is achieved. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Hilken, F., Niemann, P., Gogolla, M., & Wille, R. (2014). Filmstripping and unrolling: A comparison of verification approaches for UML and OCL behavioral models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8570 LNCS, pp. 99–116). Springer Verlag. https://doi.org/10.1007/978-3-319-09099-3_8

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