Formal analysis of STM design with SAL infinite bounded model checker

Authors:
Weiqiang Kong;Tomohiro Shiraishi;Yuki Mizushima;Noriyuki Katahira;Akira Fukuda;Masahiko Watanabe
Affiliations:
Fukuoka Industry, Science & Technology Foundation, Japan;Fukuoka Industry, Science & Technology Foundation, Japan;Fukuoka Industry, Science & Technology Foundation, Japan;Fukuoka Industry, Science & Technology Foundation, Japan;Graduate School of Information Science and Electrical Engineering, Kyushu University, Japan;CATS Co., Ltd., Japan
Venue:
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Year:
2010

Citing 3
Cited 0

The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Model checking

Model checking
Spin model checker, the: primer and reference manual

Spin model checker, the: primer and reference manual

Quantified Score

Hi-index	0.00

Visualization

Abstract

State Transition Matrix (STM) is a flexible tablelike modeling language that has been frequently used for specifying behavior of distributed systems. In this paper, we first present a formalization of the static and dynamic aspects of a STM design (i.e., design written in STM). Consequentially, based on this formalization, we investigate how a STM design can be formally analyzed using SAL, precisely SAL infinite bounded model checker, through a language translation. Specifically, the formal analysis is conducted focusing on four kinds of safety properties related to: (1) Invalid Cells, (2) Static Constraints, (3) Dynamic Constraints, and (4) Deadlock, respectively, since the fulfillment of these properties is commonly desired by industrial practitioners for a STM design. A simple Internet Connection Control system is used as our demonstration example.