面向MPP Fortran的程序自动并行化

ＭＰＰ Ｆｏｒｔｒａｎ是Ｃｒａｙ公司为分布存储、全局编址的Ｃｒａｙ Ｔ３Ｄ ＭＰＰ系统推出的一种数据并行语言。本文首先介绍了ＭＰＰ Ｆｏｒｔｒａｎ的主要特点，然后以该语言为例，对面向ＭＰＰ系统程序自动并行化的基本内容以及关键技术进行了分析和探讨。     

程序自动并行化工具FAK

该文介绍了大规模并行处理系统程序自动并行化工具ＦＡＸ（Ｆｏｒｔｒａｎ Ａｕｔｏｍａｔｅｄ Ｘｌａｔｏｒ）的系统概况。重点阐述了ＦＡＸ中所采用的先进技术。测试结果表明,ＦＡＸ已具备一定的可用性及有效性,作为面向分布主存并行机系统的程序自动并行化工具,基本达到了设计目标。     

用于大规模并行体系结构的超级编译器

本文中我们介绍一种将Ｆｏｒｔｒａｎ程序自动翻译成用于大规模体系结构的并显式并行程序的编译系统。这种编译器必须根据试探法与分析特征的组合自动产生数据分布和推导出程序变换策略。这些程序须经一个迭代协调处理包括三个主要组成部分；重构系统，性能分子分析子系统和并行化支持环境。     

VC 调用Fortran Powerstation程序

本文介绍了在 ＶＣ５．０中对 Ｆｏｒｔｒａｎ ９０程序的调用,并以一个小程序为基础,讲述各种数据类型参数 如何从Ｆｏｒｔｒａｎ传到Ｃ。     

一个新的强化别名分析算法

相关分析和程序并行化等技术已普遍受到重视，现有技术对过程内的相关分析和并行化效果是令人满意的，但是过程调用的出现为分析增添了许多困难．过程间相关性分析的目的正是为了开发含过程调用情况的程序的并行性．本文在深入研究别名对程序并行化影响的基础上，提出了一个新的强化别名分析算法，使被调用过程段的并行化成为可能．     

Sun C语言与Sun FORTRAN混合编程技术

Ｓｕｎ的ｃ语言与Ｆｏｒｔｒａｎ语言可以相互调用，灵活地使用可以充分发挥两种语言的优势，并能大大地提高工作效率。本文介绍ＦＯＲＴＲＡＮ程序如何调用Ｃ程序以及Ｃ程序如何调用ＦＯＲＴＲＡＮ程序，给出了在Ｓｕｎ工作站上通过的例子。     

AP1000＋：对并行编译器上PUT／GET接口的体系结构支持

分布式存储器并行计算机的可扩展性使它们成为解决大型问题的有力的候选机种。象ＨＰＦ，ＦｏｒｔｒａｎＤ和ＶＰＰ Ｆｏｒｔｒａｎ这些新型语言使现有软件能方便地移植这些机器上，现在已制成许多分布式存储器并行计算机，但其中没有一台支持这些语言所需的机制，我们开发了一台型分布式存储器并行计算机ＡＰ１０００＋，即ＡＰ１０００的增强型。通过使用诸如ＮＡＳ并行基准程序等ＶＰＰ Ｆｏｒｔｒａｎ 和Ｃ科学应用，我们模拟     

含过程任务图的调度

我们在Ｆｏｒｔｒａｎ程序并行转换系统ＨＺＰＡＲＡ－Ⅱ的研究中遇到了含过程任务图的情形，对此我们提出了一种有效的调度方法。该方法可在Ｏ（ｎ＊ｅ）的时间内完成调度，调度结果可以与ＣＰ调度法相比     

用于含过程调用DO循环的循环嵌入方法

循环是程序中蕴含并行性最为丰富的一种结构，因此成为并行化编译最主要的对象．但循环内的过程调用严重妨碍了循环的数据相关性分析，使得循环语句潜在的大量并行性得不到开发．本文提出的循环嵌入方法使部分含过程调用循环语句的并行化成为可能，对部分用其它过程间分析技术也能开发其并行性的这一类循环语句采用循环嵌入方法，并行化开销低，并且分析更精确．采用循环嵌入方法还可降低程序由于多次过程调用带来的调度开销．这一方法在作者开发的自动并行化编译系统AFT（automaticPortrantransformer）中得到了实现，对Spec92测试程序包的试验结果表明了本文提出的方法是行之有效的．     

MPI通信代码自动生成算法

对于高性能并行计算机而言，如何由给出的计算、数据划分信息及精确数组数据流分析信息自动生成并行化代码是实现串行程序并行化的一个重要问题。根据Saman P.Amarasinghe和Lam的定理，实现了一种并行化识别工具中MPI（Message Passing Interface）并行化代码自动生成技术的算法，并对该算法的性能进行分析。     

Precise Call Graphs for C Programs with Function Pointers

The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory accesses through pointer dereferences, as well as indirect procedure calls (e.g., through function pointers in C). Such indirect accesses and calls can be disambiguated with pointer analysis. In this paper we evaluate the precision of one specific pointer analysis (the FA pointer analysis by Zhang et al.) for the purposes of call graph construction for C programs with function pointers. The analysis is incorporated in a production-strength code-browsing tool from Siemens Corporate Research in which the program call graph is used as a primary tool for code understanding.The FA pointer analysis uses an inexpensive, almost-linear, flow- and context-insensitive algorithm. To measure analysis precision, we compare the call graph constructed by this analysis with the most precise call graph obtainable by a large category of existing pointer analyses. Surprisingly, for all our data programs the FA analysis achieves the best possible precision. This result indicates that for the purposes of call graph construction, inexpensive pointer analyses may provide precision comparable to the precision of expensive pointer analyses.     

Weakly sensitive analysis for JavaScript object-manipulating programs

While JavaScript programs have become pervasive in web applications, they remain hard to reason about. In this context, most static analyses for JavaScript programs require precise call graph information, since the presence of large numbers of spurious callees significantly deteriorates precision. One of the most challenging JavaScript features that complicate the inference of precise static call graph information is read/write accesses to object fields, the names of which are computed at runtime. JavaScript framework libraries often exploit this facility to build objects from other objects, as a way to simulate sophisticated high-level programming constructions. Such code patterns are difficult to analyze precisely, due to weak updates and limitations of unrolling techniques. In this paper, we observe that precise field origination relations can be inferred by locally reasoning about object copies, both regarding to the object and to the program structure, and we propose an abstraction that allows to separately reason about field read/write access patterns working on different fields and to carefully handle the sets of JavaScript object fields. We formalize and implement an analysis based on this technique. We evaluate the performance and precision of the analysis on the computation of call graph information for examples from jQuery tutorials.     

Trin-Trin: Who’s Calling? A Pin-Based Dynamic Call Graph Extraction Framework

Multi-core based systems are ubiquitous in data centers. Efficient exploitation of hardware parallelism supported by such systems is imperative on multiple fronts: minimizing latency and power consumption and maximizing throughput. This in turn calls for advanced program analysis and optimization. Call graphs have been long used to this end. Although several static call graph extraction techniques have been proposed in the past, these techniques cannot be applied to analyze programs already running in production. Likewise, the existing dynamic call graph extraction tools have limited use in production owing to, say (but not limited to), lack of support for capturing wall clock time spent in functions of a given program and lack of means to analyze the call graph information captured at run time. In this paper, we present a Pin-based dynamic call graph extraction framework called Trin-Trin. The framework enables extraction of complete, precise and dynamic call graphs. Additionally, the framework can be used seamlessly with already running applications. Furthermore, an analytics engine is provided to facilitate advanced program analysis, e.g., different multithreading context(s) of any function can be extracted in a demand-driven fashion. We evaluate the overhead of Trin-Trin using several Unix utilities, applications from the industry-standard SPEC CINT2006, CFP2006 benchmark suite and Yahoo! properties. Additionally, we present a case study to illustrate how Trin-Trin can be used to analyze performance bottlenecks and performance regressions.     

call图与基于call图的相关分析

ｃａｌｌ图用来反映程序中过程之间的调用关系，在程序分析和程序转换中起着重要的作用。本文首先讨论了简单情形下ｃａｌｌ图的构造算法，然后提出了过程向量及其映射函数的概念，从而设计出一种针对允许过程作为参数时ｃａｌｌ图的构造算法，并对该算法进行了详细的分析，其时间复杂度为Ｏ。本文最后讨论并分析了基于ｃａｌｌ图的程序相关分析方法。     

带控制流的静态函数调用分析方法

提出一种带有控制流的静态函数调用分析的方法,通过建立模型,对源程序进行静态分析,得到程序中的控制流信息和函数调用信息。和已有的静态函数调用关系图分析工具calltree和Source Insight相比,该方法生成的函数调用流图不仅能展现函数间的调用次序,还可以了解程序设计的逻辑复杂度,有助于代码阅读和分析人员更快更好地理解程序结构以及设计流程,并为分析程序控制条件、设计路径覆盖测试用例和进行程序优化奠定基础。     

Design and implementation of a fine-grained software inspection tool

Although software inspection has led to improvements in software quality, many software systems continue to be deployed with unacceptable numbers of errors, even when software inspection is part of the development process. The difficulty of manually verifying that the software under inspection conforms to the rules is partly to blame. We describe the design and implementation of a tool designed to help alleviate this problem. The tool provides mechanisms for fine-grained inspection of software by exposing the results of sophisticated whole-program static analysis to the inspector. The tool computes many static-semantic representations of the program, including an accurate call graph and dependence graph. A whole-program pointer analysis is used to make sure that the representation is precise with respect to aliases induced by pointer usage. Views on the dependence graph and related representations are supported. Queries on the dependence graph allow an inspector to answer detailed questions about the semantics of the program. Facilities for openness and extensibility permit the tool to be integrated with many software development processes. The main challenge of the approach is to provide facilities to navigate and manage the enormous complexity of the dependence graph.     

图卷积网络的抗混淆安卓恶意软件检测

自安卓发布以来,由于其开源、硬件丰富和应用市场多样等优势,安卓系统已经成为全球使用最广泛的手机操作系统。同时,安卓设备和安卓应用的爆炸式增长也使其成为96%移动恶意软件的攻击目标。现存的安卓恶意软件检测方法中,忽视程序语义而直接提取简单程序特征的方法检测速度快但精确度不理想,将程序语义转换为图模型并采用图分析的方法精确度高但开销大且扩展性低。为了解决上述挑战,本文将应用的程序语义提取为函数调用图,保留语义信息的同时采用抽象API技术将调用图转换为抽象图以减少运行开销并增强鲁棒性。基于得到的抽象图,以Triplet Loss损失训练构建基于图卷积神经网络的抗混淆安卓恶意软件分类器SriDroid。对20246个安卓应用进行实验分析之后,发现SriDroid可以达到99.17%的恶意软件检测精确度,并具有良好的鲁棒性。     

Characterization and automatic identification of type infeasible call chains

Many software engineering applications utilize static program analyses to gain information about programs. Some applications perform static analysis over the whole program's call graph, while others are more interested in specific call chains within a program's call graph. A particular static call chain for an object-oriented program may in fact be impossible to execute, or infeasible, such that there is no input for which the chain will be taken. Identifying infeasible static call chains can save time and resources with respect to the targeted software development tool. This paper examines type infeasibility of call chains, which may be caused by inherently polymorphic call sites and are sometimes due to imprecision in call graphs. The problem of determining whether a call chain is type infeasible is defined and exemplified, and a key property characterizing type infeasible call chains is described. An empirical study was performed on a set of Java programs, and results from examining the call graphs of these programs are presented. Finally, an algorithm that automatically determines the type infeasibility of a call chain due to object parameters is presented.     

面向方面程序的调用图生成算法

调用图(call graph)分析是进行程序分析、程序理解、软件测试和软件维护的重要基础.目前已提出的调用图生成算法多数是针对面向对象编程;而面向方面编程作为面向对象编程的扩展,还没有比较良好的调用图生成算法.为此,分析了既有的面向对象程序调用图生成算法,讨论了面向方面程序语言(AspectJ为例)的特殊语言元素及其对生成的调用图的影响,从而构筑了面向方面程序调用图的生成算法.     

一种改进的静态程序切片算法

提出了一种改进的静态程序切片算法,并应用到软件逆向工程中。在处理目标程序的过程间调用时,通过建立参数影射关系表,将过程间调用转换为过程内调用,简化了建立程序依赖图的复杂度;在归纳分析目标程序变量类型的基础上,给出了代数运算法则,对程序中的线性运算代码进行等价变换,缩减了切片程序的规模。最后通过具体的切片实例,证明了改进算法的有效性。