Model Checking by Generating Observers from an Interface Specification Between Components

被引:0
作者
Hasegawa, Tetsuo [1 ]
Fukazawa, Yoshiaki [1 ]
机构
[1] Waseda Univ, Shinjuku Ku, Tokyo, Japan
来源
INFORMATION SYSTEMS: MODELING, DEVELOPMENT, AND INTEGRATION | 2009年 / 20卷
关键词
model cheking; UML; timing diagram;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the field of embedded software systems where many kinds of systems must be developed in a short period of time and at low cost, model checking, which is one of the automatic design verification techniques, is expected to become easy for software designers to use. The difficulties of model checking include the describing Of queries or observers as the system property to be verified, and the analyzing of a counterexample in order to find the cause of a fault. There are methods to solve these problems such as generating observers from ordinary software design formats describing system behavior rules, and comparing that behavior with a counterexample to locate a reason for the fault. In this paper, a method generating observers from a timing diagram that describes an interface specification between two components is proposed. The purpose is to make it possible for designers to describe queries of verification easily and also analyze counterexamples easily. In addition, the result of applying this method to a communication protocol application is reported.
引用
收藏
页码:526 / 538
页数:13
相关论文
共 12 条
[1]  
Behrmann G, 2004, LECT NOTES COMPUT SC, V3185, P200
[2]   Timed automata: Semantics, algorithms and tools [J].
Bengtsson, J ;
Yi, W .
LECTURES ON CONCURRENCY AND PETRI NETS: ADVANCES IN PETRI NETS, 2004, 3098 :87-124
[3]  
BENGTSSON J, 1996, LNCS, V1102
[4]  
Berard B., 2001, Sys- tems and Software Verification, Model-Checking Techniques and Tools
[5]  
David A, 2002, LECT NOTES COMPUT SC, V2306, P218
[6]  
DAVID A, 2001, BRICS TECHNICAL REPO
[7]  
Dwyer M. B., 1999, P 21 INT C SOFTW ENG
[8]  
Firley T, 1999, LECT NOTES COMPUT SC, V1723, P645
[9]  
HAVELUND K, 1998, P 4 INT SPIN WORKSH
[10]  
INVERARDI P, 2001, P 16 ASE 2001