| 基于中国邮递员问题的可信平台模块测试序列生成优化研究 |
| |
| 引用本文： | 徐士伟,张焕国,肖瑾瑜,严飞.基于中国邮递员问题的可信平台模块测试序列生成优化研究[J].武汉大学学报(理学版),2010,56(2). |
| |
| 作者姓名： | 徐士伟 张焕国 肖瑾瑜 严飞 |
| |
| 作者单位： | 1. 武汉大学,计算机学院,湖北,武汉,430072
2. 武汉大学,计算机学院,湖北,武汉,430072;武汉大学,空天信息安全与可信计算教育部重点实验室,湖北,武汉,430072 |
| |
| 基金项目： | 国家高技术研究发展计划(863)项目(2007AA01Z411); 国家自然科学基金资助项目(60673071,60970116,90718005,90718006) |
| |
| 摘 要： | 现今国内外已经有不少对可信平台模块进行测试的研究成果,但是对测试效率分析不足.本文基于自动机理论和中国邮递员问题,提出了可信平台模块改进的有限状态机模型与相应的优化测试方案,通过寻找一条遍历有限状态机模型中每一条转移至少一次的最短路径的方法,从而生成费用优化的测试序列.测试结果表明,测试方案能够简化有限状态机状态的测试.
|
| 关 键 词： | 可信平台模块 中国邮递员问题 状态机理论 测试优化 |
Testing Sequences Generation Optimization for Trusted Platform Module Based on Chinese Postman Problem |
| |
| XU Shiwei,ZHANG Huanguo,XIAO Jinyu,YAN Fei.Testing Sequences Generation Optimization for Trusted Platform Module Based on Chinese Postman Problem[J].JOurnal of Wuhan University:Natural Science Edition,2010,56(2). |
| |
| Authors: | XU Shiwei ZHANG Huanguo XIAO Jinyu YAN Fei |
| |
| Institution: | XU Shiwei1,ZHANG Huanguo1,2,XIAO Jinyu1,YAN Fei1,2(1.School of Computer,Wuhan University,Wuhan 430072,Hubei,China,2.Key Laboratory of Aerospace Information Security , Trusted Computingof Ministry of Education,China) |
| |
| Abstract: | Nowadays,there are already not just few researches on testing TPM(trusted platform module),but they are lack of the analysis of testing efficiency.On the basis of improving the finite state machine(FSM) model of TPM,this paper applies the Chinese postman problem to the conformance testing of the model.In order to generate the optimized test sequences,a shortest path,in which each transition should be traversed at least once,is found out in the model.Meanwhile,the test on the states of FSM is also simplified... |
| |
| Keywords: | trusted platform module Chinese postman problem state machine theory test optimization |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
