arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1108.2683cs.PL
收藏

利用类层次结构改进指向集的位向量表示

Improving bit-vector representation of points-to sets using class hierarchy

Hamid A. Toussi, Ahmed Khademzadeh

摘要:

指向分析是静态地或在编译时近似指针的运行时值的问题。指向集用于在指向分析期间存储指针的近似值。内存使用和运行时间限制了point-to分析分析大型程序的能力。据我们所知,到目前为止,已经实现了指向集合的位向量表示的作品,为每个指针分配位而不考虑指针的类型。通过考虑类型,我们能够只为所有抽象对象的子集分配位,这些抽象对象的类型与指针的类型兼容,从而提高内存使用率和运行时间。为了实现这个目标,我们对抽象对象进行编号,使一个类型的所有抽象对象及其所有子类型按顺序连续。我们最高效的实现比混合point-to-set(Spark中的默认point-to-set)使用的内存少2.5倍,并且还可以提高足够大的程序的分析时间。

英文摘要:

Points-to analysis is the problem of approximating run-time values of pointers statically or at compile-time. Points-to sets are used to store the approximated values of pointers during points-to analysis. Memory usage and running time limit the ability of points-to analysis to analyze large programs. To our knowledge, works which have implemented a bit-vector representation of points-to sets so far, allocates bits for each pointer without considering pointer's type. By considering the type, we are able to allocate bits only for a subset of all abstract objects which are of compatible type with the pointer's type and as a consequence improve the memory usage and running time. To achieve this goal, we number abstract objects in a way that all the abstract objects of a type and all of its sub-types be consecutive in order. Our most efficient implementation uses about 2.5 times less memory than hybrid points-to set (default points-to set in Spark) and also improves the analysis time for sufficiently large programs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑