Encoding OCL data types for SAT-based verification of UML/OCL models

  • Authors:

  • Mathias Soeken;Robert Wille;Rolf Drechsler

  • Affiliations:

  • Institute of Computer Science, University of Bremen, Computer Architecture Group, Bremen, Germany;Institute of Computer Science, University of Bremen, Computer Architecture Group, Bremen, Germany;Institute of Computer Science, University of Bremen, Computer Architecture Group, Bremen, Germany

  • Venue:
  • TAP'11 Proceedings of the 5th international conference on Tests and proofs
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Checking the correctness of UML/OCL models is a crucial task in the design of complex software and hardware systems. As a consequence, several approaches have been presented which address this problem. Methods based on satisfiability (SAT) solvers have been shown to be very promising in this domain. Here, the actual verification task is encoded as an equivalent bit-vector instance to be solved by an appropriate solving engine. However, while a bit-vector encoding for basic UML/OCL constructs has already been introduced, no encoding for nontrivial OCL data types and operations is available so far. In this paper, we close this gap and present a bit-vector encoding for more complex OCL data types, i.e. sets, bags, and their ordered counterparts. As a result, SAT-based UML/OCL verification becomes applicable for models containing these collections types. A case study illustrates the application of this encoding.