The Verification of rCOS Using Spin

  • Authors:
  • Xiao Yu;Zheng Wang;Geguang Pu;Dingding Mao;Jing Liu

  • Affiliations:
  • Software Engineering Institute, East China Normal University, Shanghai, China;Software Engineering Institute, East China Normal University, Shanghai, China;Software Engineering Institute, East China Normal University, Shanghai, China;Software Engineering Institute, East China Normal University, Shanghai, China;Software Engineering Institute, East China Normal University, Shanghai, China

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The rCOS is a relational object-based language with a precise observation-oriented semantics. It can capture key features of object model including subtypes, visibility, inheritance, polymorphism and so on. To analyze the model specified by rCOS, we propose a verification approach to check whether those properties such as the assertion, invariant of class and method contracts hold. The Spin model checker is used in this approach. To enhance the ability of description of concurrency, we extend the original rCOS with parallel structure and synchronization mechanism. The Promela model is constructed from rCOS specification with non-trivial mapping rules. We also present a case study to show how our approach works.