Abstract

Unified Modeling Language (UML) and Object Constraint Language (OCL) are the most commonly used languages to model software systems. OCL is a formal language used to specify invariants as well as pre- and post-conditions on UML diagrams. However, there is no meaner to verify the satisfaction of the OCL constraints properties by the modeled system. This paper presents a formal approach to reason about UML Class Diagram (CD) and OCL “pre-” and “post-conditions” described on CD operations (or methods) using Observational Transition Systems in CafeOBJ (OTS/CafeOBJ) and proof scores of CafeOBJ. CafeOBJ is an executable formal algebraic specification language widely used to specify models for varieties of software and systems and verifying properties of them.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call