Automatic verification of any number of concurrent, communicating processes

被引:7
作者
Calder, M [1 ]
Miller, A [1 ]
机构
[1] Univ Glasgow, Dept Comp Sci, Glasgow G12 8QQ, Lanark, Scotland
来源
ASE 2002: 17TH IEEE INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING | 2002年
关键词
D O I
10.1109/ASE.2002.1115017
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The automatic verification of concurrent systems by model-checking is limited due to the inability to generalise results to systems consisting of any number of processes. We use abstraction to prove general results, by model-checking, about feature interaction analysis of a telecommunications service involving any number of processes. The key idea is to model-check a system of constant number (m) of concurrent processes, in parallel with an "abstract" process which represents the product of any number of other processes. The system, for any specified set of selected features, is generated automatically using Perl scripts.
引用
收藏
页码:227 / 230
页数:4
相关论文
共 9 条
[1]  
[Anonymous], LECT NOTES COMPUTER
[2]  
CALDER M, 2001, LECT NOTES COMPUTER, V2057, P143
[3]  
CALDER M, 2002, TR2002110 U GLASG DE
[4]  
CALDER M, 2000, FEATURE INTERACTIONS, V6
[5]  
Clarke E.M., 1995, LNCS, V962, P395
[6]   The model checker SPIN [J].
Holzmann, GJ .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1997, 23 (05) :279-295
[7]   Verifying systems with replicated components in Murφ [J].
Ip, CN ;
Dill, DL .
FORMAL METHODS IN SYSTEM DESIGN, 1999, 14 (03) :273-310
[8]  
KRZYSZTOF R, 1986, INFORMATION PROCESSI, V22, P307
[9]  
Kurshan R. P., 1989, Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, P239, DOI 10.1145/72981.72998