A-CluB: Automated Cluster Breaking

A-CluB：自动集群破坏

• 批准号: EP/F010443/1
• 负责人: Mark Harman
• 金额: $ 7.63万
• 依托单位: King's College London
• 依托单位国家: 英国
• 项目类别: Research Grant
• 财政年份: 2007
• 资助国家: 英国
• 起止时间: 2007 至 无数据
• 项目状态: 已结题
• 来源: https://gtr.ukri.org/projects?ref=EP%2FF010443%2F1
• 关键词: CluB; Automated; Cluster; Breaking

Recent work shows that many real world programs contain large dependence clusters: knots of mutually dependent program statements. In a dependence cluster, every statement depends on every other statement. It is not hard to imagine the difficulties that large dependence clusters may produce. In order to understand any statement in a dependence cluster, it is possible that all other statements in the cluster need to be considered. It will be very hard to disentangle statements in a cluster to allow reuse of components, or refactoring of the system. Any potential change to an element of a cluster, will have an impact that is large and potentially far reaching, because it may affect any or all of the other statements in the cluster.This visiting fellow project builds on the previous work of Binkley and Harman (and others) on slice based dependence analysis. The aim is to better understand the empirically observed phenomenon of dependence clusters and to develop algorithms and techniques for decomposing these clusters. This will produce algorithms and methods for Automated Cluster Busting, thereby overcoming the problems that these clusters pose.

最近的工作表明，许多现实世界的程序包含大量的依赖簇：相互依赖的程序语句的结。在依赖集群中，每个语句都依赖于其他每个语句。不难想象大型依赖集群可能产生的困难。为了理解依赖簇中的任何语句，可能需要考虑该簇中的所有其他语句。很难解开集群中的语句以允许组件的重用或系统的重构。对集群中某个元素的任何潜在更改都将产生巨大且可能深远的影响，因为它可能会影响集群中的任何或所有其他语句。该访问研究员项目建立在 Binkley 和 Harman 之前的工作基础上（和其他）基于切片的依赖性分析。目的是更好地理解凭经验观察到的依赖簇现象，并开发分解这些簇的算法和技术。这将产生自动集群清除的算法和方法，从而克服这些集群带来的问题。

项目成果

Empirical evaluation of a nesting testability transformation for evolutionary testing

• DOI: 10.1145/1525880.1525884
• 发表时间: 2009-05
• 期刊: ACM Trans. Softw. Eng. Methodol.
• 作者: Phil McMinn;D. Binkley;M. Harman