摘要
为了提高在Java程序可达性测试中的同步序列生成效率,提出了一个新算法从无时序约束关系的同步事件派生竞争变形体集,避免或减少了不可行的竞争变形体的生成.定义了同步事件之间的线程家族时序约束关系,并详述了此约束关系的信息抽取算法和判定算法.
To improve efficiency of generating synchronization sequences in reachability testing of Java programs, a new algorithm is proposed. It derives race variants set from synchronization events which have no sequential constraints, and avoids or reduces the generating of infeasible race variants. A sequential constraint relation between synchronization events is defined based on their threads＇family relation. Two key algorithms are described in details. One is for extracting information of sequential constraints from a tested program, and the other is for determining whether two synchronization events have sequential constraint or not.
出处
《暨南大学学报（自然科学与医学版）》
CAS
CSCD
北大核心
2006年第5期670-675,共6页
Journal of Jinan University(Natural Science & Medicine Edition)
基金
国家自然科学基金(60173038)资助项目
广东省科学基金(010421)资助项目
关键词
JAVA程序
可达性测试
同步序列
时序约束
竞争变形体
Java program
reachability testing
synchronization sequence
sequential constraint
race variant
