一个用于Java程序可达性测试的改进方案  

An Improved Scheme for Reachability Testing of Java Programs

作　　者：孙玉霞[1] 陈火炎[2] 

机构地区：[1]暨南大学信息学院计算机系,510632 [2]暨南大学

出　　处：《微计算机信息》2006年第06X期252-254,36,共4页Control & Automation

基　　金：国家自然科学基金项目(编号:60173038);广东省科学基金项目(编号:010421)

摘　　要：Java程序的并发性使它比串行程序更难测试,而可达性测试是一种有效的并发程序测试方法。首先比较了现有的Java程序可达性测试技术,进而提出了一种融合的改进方案以提高同步序列集的生成效率。然后指出新方案已覆盖了用伯恩斯坦条件裁减同步序列集的功能。最后详述如何通过扫描源程序来自动获取同步事件的时序约束关系,进而减少不可行的同步序列,并介绍了相应的实现算法和数据结构。Java programs are more difficult to test than sequential programs because of concurrency. Reachability testing is an effective approach to testing concurrent programs. First compare the existing teachability testing techniques on Java programs, and propose a new combined scheme to improve the efficiency of generating synchronization sequences. And then demonstrate that the new scheme covered the functionality of reducing synchronization sequences offered by utilizing Bemstein condition. Finally focus on how to automatically acquire the sequential constraints between synchronization events by scanning source programs and apply the constraints in decreasing infeasible synchronization sequences, and introduce the algorithm and data structure of the implementation.

关 键 词：可达性测试 同步序列 伯恩斯坦条件 时序约束 

分 类 号：TP311.56[自动化与计算机技术—计算机软件与理论]