A-CluB: Automated Cluster Breaking

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

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.