Towards checking parametric reachability for UML state machines

  • Authors:
  • Artur Niewiadomski;Wojciech Penczek;Maciej Szreter

  • Affiliations:
  • ICS, University of Podlasie, Siedlce, Poland;ICS, University of Podlasie, Siedlce, Poland;ICS, Polish Academy of Sciences, Warsaw, Poland

  • Venue:
  • PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper presents a new approach to model checking of systems specified in UML. All the executions of an UML system (unfolded to a given depth) are encoded directly into a boolean propositional formula, satisfiability of which is checked using a SAT-solver. Contrary to other UML verification tools we do not use any of the existing model checkers as we do not translate UML specifications into an intermediate formalism. Moreover, we introduce some parametric extensions to the method. The method has been implemented as the (prototype) tool BMC4UML and several experimental results are presented.