Practical Compile-Time Analysis Algorithms: (FAW)

编译时分析技术，以帮助开发软件在顺序和并行编程环境将是本研究的重点。有两种信任：(i)为软件系统中源代码更改的语义影响分析设计增量数据流算法的工作的成熟，以及（ii）对编译时分析如何帮助具有隐式和/或显式并行性的程序的编译和调试的调查。在调试并发系统时，编译时分析用于帮助程序员调试具有显式并行性的软件。典型的问题包括共享内存机器中的竞争、对同一内存位置的不确定顺序访问（其中至少有一次访问是写操作）以及死锁（由于不正确的同步而无法继续的非终止计算）。为了在共享内存机器上进行检测，正在探索使用过程间数据流信息和并行原语的良好内部表示，以及分析Ada会合机制的案例研究。它的目的是将这些问题的编译时分析与运行时测试结合起来，使用前者来指导后者。这项工作最终将开发原型软件工具，在实际的Ada和Fortran程序上演示这些技术。期望的扩展包括研究对广泛同步原语的适用性，并根据这些问题对它们的属性进行分类。

Compile-time analysis techniques to aid the development of software in sequential and parallel programming environments will be the focus of this research. There are two trusts: (i) the maturation of work in designing incremental data flow algorithms for semantic impact analysis of source code changes in software systems, and (ii) the investigation of how compile-time analysis can aid the compilation and debugging of programs that have implicit and/or explicit parallelism. In debugging of concurrent systems, compile-time analysis is used to help programmers debug software written with explicit parallelism. Typical problems include races in shared memory machines, indeterminately ordered accesses to the same memory location where at least one access is a write, and deadlocks, non-terminating computations which cannot continue because of improper synchronizations. For detection on shared memory machines, use of interprocedural data flow information and good internal representations of parallel primitives are being explored, as well as a case study analyzing Ada rendezvous mechanisms. It is intended to combine compile-time analysis with run-time testing for these problems, using the former to guide the latter. This work will culminate in development of prototype software tools demonstrating the techniques on actual Ada and Fortran programs. Desired extensions include studying the applicability to a broad range of synchronization primitives and classifying their properties with respect to these problems.