Formal behavior modeling and effective automatic refinement

  • Authors:

  • Shuaiqiang Wang;Jun Ma;Qiang He;Jiancheng Wan

  • Affiliations:

  • School of Computer Science and Technology, Shandong University, Shunhua Road, High-New Industrial Development Zone, 250101 Jinan, China;School of Computer Science and Technology, Shandong University, Shunhua Road, High-New Industrial Development Zone, 250101 Jinan, China;School of Computer Science and Technology, Shandong University, Shunhua Road, High-New Industrial Development Zone, 250101 Jinan, China;School of Computer Science and Technology, Shandong University, Shunhua Road, High-New Industrial Development Zone, 250101 Jinan, China

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2010

Quantified Score

Hi-index 0.07

Visualization

Abstract

Modeling and refining behaviors of software systems are two crucial issues in the methodology of Model-Driven Development (MDD). Traditional methods include Unified Modeling Language (UML) based methods and formal methods. Recently integrated methods by taking full advantages of these two methods have received increasing attention. Unfortunately, there are still no effective formal modeling and automatic refinement methods for behaviors. Besides, difficulties exist in generating some structures, e.g., explicit loop structures, via existing approaches. In this paper, we propose a B-notations based framework for formal modeling and automatically refining behaviors. In our framework, three issues are involved: automatic behavior modeling, theory of behavior refinement, and automatic behavior refinement. For automatic behavior modeling, we propose a B-notation based automatic modeling method for behaviors. For theory of behavior refinement, we propose a refinement theory focusing on behaviors that regards the behavior refinement problem as a search problem. For automatic behavior refinement, we propose an automatic refinement approach by combining top-down logic reduction based method and bottom-up local search based method, where explicit loop structures can be well generated.