Using Spreadsheets for Finite State Modelling

被引:0
作者
Chakrabarti, Sujit Kumar [1 ]
Sukumaran, Srihari [1 ]
机构
[1] Philips Healthcare, Bangalore, Karnataka, India
来源
ISEC 2009 - PROCEEDINGS OF THE 2ND INDIA SOFTWARE ENGINEERING CONFERENCE | 2009年
关键词
finite state machines; spreadsheets; SAL;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
State based modelling is a widely used practice in the software industry. There are two methods of building state based models: either using graphical modelling tools, or using formal languages like SMV or SAL. The former method often suffers from the problem of cost, in particular, when the modelling requirements are lightweight, purchase of an elaborate modelling tool does not turn out to be cost effective. The latter method suffers from learning complexity problem. Software engineers, who write the specifications, are usually not familiar with formal languages On the other hand, a large number of software engineers find it convenient to write their specifications semi-formally using tools such as spreadsheets. We formalise the spreadsheet finite modelling language and demonstrate that it is expressive enough to capture most important notions of finite state modelling. We show that this language is sufficiently usable in terms of readability and maintainability. We also present SAL-gen, a tool that takes as an input a finite state model written in our language, and generates corresponding SAL code. This can form the basis for analysis tools such as property checkers and test generators using the existing SAL tool set.
引用
收藏
页码:27 / 36
页数:10
相关论文
共 10 条
[1]  
de Moura L, 2004, LECT NOTES COMPUT SC, V3114, P496
[2]  
DEMOURA L, 2005, AUTOMATED TEST GENER
[3]  
Harel D., 1996, ACM Transactions on Software Engineering and Methodology, V5, P293, DOI 10.1145/235321.235322
[4]   STATECHARTS - A VISUAL FORMALISM FOR COMPLEX-SYSTEMS [J].
HAREL, D .
SCIENCE OF COMPUTER PROGRAMMING, 1987, 8 (03) :231-&
[5]  
HONG H, 2001, AUTOMATED TEST GENER
[6]  
Hopcroft J. E., 2007, Introduction to automata theory, languages, and computation, V3rd
[7]  
*IEEE, IEEE STAND GLOSS SOF
[8]  
LYNCH NA, 1992, P REAL TIM THEOR PRA, P397
[9]  
MUJJIGA S, 2007, GENERATING TESTS VAL
[10]  
MUJJIGA S, 2007, P AFM 07 WORKSH AUT