SSA形式并行程序设计的概率分析
Probabilistic Alias Analysis for Parallel Programming in SSA Forms
摘要：
不同类型程序设计语言的静态别名分析一直是研究者关注的问题。然而，大多数现有的别名分析技术的结果是不够精确的现代编译器的需要相比。在现代编译器的优化技术中，需要这些结果的概率版本，其中结果元素与发生概率相关联。本文提出了一种新的并行程序别名分析的概率方法。所处理的并行模型是SPMD，其中在SPMD中，使用在不同数据上的分布式机器上运行的固定数量的程序线程来执行程序。被分析的程序被假定为在静态单分配（SSA）的形式，这是一个程序表示形式，方便程序分析。所提出的技术具有简单的推理规则系统的形式。这使得能够在诸如携带证明代码（PPC）的应用中使用该系统，PPC是用于证明现代程序的安全特性的通用技术。
英文摘要：
Static alias analysis of different type of programming languages has been drawing researcher attention. However most of the results of existing techniques for alias analysis are not precise enough compared to needs of modern compilers. Probabilistic versions of these results, in which result elements are associated with occurrence probabilities, are required in optimizations techniques of modern compilers. This paper presents a new probabilistic approach for alias analysis of parallel programs. The treated parallelism model is that of SPMD where in SPMD, a program is executed using a fixed number of program threads running on distributed machines on different data. The analyzed programs are assumed to be in the static single assignment (SSA) form which is a program representation form facilitating program analysis. The proposed technique has the form of simply-strictured system of inference rules. This enables using the system in applications like Proof-Carrying Code (PPC) which is a general technique for proving the safety characteristics of modern programs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
