Combining static analysis and case-based search space partitioning for reducing peak memory in model checking

被引:11
作者
Zhang, WH [1 ]
机构
[1] Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
关键词
model checking; static analysis; search space partitioning; spin; protocol verification;
D O I
10.1007/BF02945465
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Memory is one of the critical resources in model checking. This paper discusses a strategy for reducing peak memory in model checking by case-based partitioning of the search space. This strategy combines model checking for verification of different cases and static analysis or expert judgment for guaranteeing the completeness of the cases. Description of the static analysis is based on using PROMELA as the modeling language. The strategy is applicable to a subset of models including models for verification of certain aspects of protocols.
引用
收藏
页码:762 / 770
页数:9
相关论文
共 25 条
[21]  
PELED D, 1993, LECT NOTES COMPUTER, V697, P409
[22]  
Somenzi F., 2000, P 12 INT C COMPUTER, P248, DOI DOI 10.1007/10722167
[23]  
Stahl K, 1999, LECT NOTES COMPUT SC, V1680, P57
[24]  
Valmari A., 1992, Formal Methods in System Design, V1, P297, DOI 10.1007/BF00709154
[25]  
ZHANG W, 2002, LECT NOTES COMPUTER, V2434, P113