并发程序原子图挖掘技术  

Atom Graph Mining Technology in Concurrent Program

作　　者：朱一清[1] 

机构地区：[1]上海交通大学软件学院,上海200240

出　　处：《计算机工程》2012年第18期30-33,共4页Computer Engineering

基　　金：国家自然科学基金资助面上项目(60673120)

摘　　要：针对当前并发程序的不确定性和复杂性,以及程序原子性质获取困难的问题,提出一种并发程序原子性质提取方法。将并发程序中的同步区域转化为与并发操作相关的并发操作图后,采用频繁子图挖掘算法自动提取程序中的原子图,使其能刻画并发程序的原子性质,包括并发操作以及操作之间的控制依赖关系。实验结果证明,该方法能以较低的误测率有效提取并发程序的原子性质。Because of the complexity and uncertainty of parallel behaviors,currently it is difficult to get atom rules from concurrent programs.Aiming at the problem,this paper presents a new atom property extraction method in concurrent program.A technique to automatically extract atom property from programs forms graph structure by using a frequent subgraph mining algorithm.It targets at inferring atomicity of both low level read-write operations as well as high level functional operations on multiple variables with rich structure information.Experimental result shows that this method manages to find atom property with a relatively high accuracy.

关 键 词：并发程序 原子图 原子性质 多线程 频繁子图挖掘 

分 类 号：TP12[自动化与计算机技术—控制理论与控制工程]