一个生成Java程序同步序列集的新算法  

A new algorithm for generating synchronization sequence sets of Java programs

作　　者：孙玉霞[1] 

机构地区：[1]暨南大学计算机系,广东广州510632

出　　处：《暨南大学学报（自然科学与医学版）》2006年第5期670-675,共6页Journal of Jinan University(Natural Science & Medicine Edition)

基　　金：国家自然科学基金(60173038)资助项目;广东省科学基金(010421)资助项目

摘　　要：为了提高在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.

关 键 词：JAVA程序 可达性测试 同步序列 时序约束 竞争变形体 

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