Model checking dynamic UML consistency

  • Authors:
  • Xiangpeng Zhao;Quan Long;Zongyan Qiu

  • Affiliations:
  • LMAM and Department of Informatics, School of Math., Peking University, Beijing, China;LMAM and Department of Informatics, School of Math., Peking University, Beijing, China;LMAM and Department of Informatics, School of Math., Peking University, Beijing, China

  • Venue:
  • ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

UML is widely accepted and extensively used in software modeling. However, using different diagrams to model different aspects of a system brings the risk of inconsistency among diagrams. In this paper, we investigate an approach to check the consistency between the sequence diagrams and statechart diagrams using the SPIN model checker. To deal with the hierarchy structure of statechart diagrams, we propose a formalism called Split Automata, a variant of automata, which is helpful to bridge the statechart diagrams to SPIN efficiently. Compared with the existing work on model checking UML which do not have formal verification for their translation from UML to the model checker, we formally define the semantics and prove that the automatically translated model (i.e. Split Automata) does simulate the UML model. In this way, we can guarantee that the translated model does represent the original model.