A position paper on compile-time program analysis

Current challenges to the compile-time analysis research community include unifying the nomenclature in program analysis, embedding analyses in practical software tools, influencing programming language design to allow analysis, and adapting analyses to the blend of architectures, languages and operating systems common in modern software. These challenges must be met to ensure that compile-time analyses will continue to be of practical benefit.

[1]  Bjarne Steensgaard,et al.  Points-to analysis in almost linear time , 1996, POPL '96.

[2]  Barbara G. Ryder.  ISMM: the incremental software maintenance manager , 1989, Proceedings. Conference on Software Maintenance - 1989.

[3]  Barbara G. Ryder,et al.  Defining flow sensitivity in data flow problems , 1995 .

[4]  Jong-Deok Choi,et al.  Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects , 1993, POPL '93.

[5]  Barbara G. Ryder,et al.  Profiling an Incremental Data Flow Analysis Algorithm , 1990, IEEE Trans. Software Eng..

[6]  Elaine J. Weyuker,et al.  Data flow-based test adequacy analysis for languages with pointers , 1991, TAV4.

[7]  Constantine D. Polychronopoulos,et al.  Parallel programming and compilers , 1988 .

[8]  Dirk Grunwald,et al.  Reducing indirect function call overhead in C++ programs , 1994, POPL '94.

[9]  Ken Kennedy,et al.  A Parallel Programming Environment , 1985, IEEE Software.

[10]  Jong-Deok Choi,et al.  Flow-Insensitive Interprocedural Alias Analysis in the Presence of Pointers , 1994, LCPC.

[11]  Barbara G. Ryder,et al.  Program decomposition for pointer aliasing: a step toward practical analyses , 1996, SIGSOFT '96.

[12]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[13]  M. Burke,et al.  Eecient Flow-sensitive Interprocedural Computation of Pointer-induced Aliases and Side Eeects , 1993 .

[14]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[15]  G. A. Venkatesh,et al.  The semantic approach to program slicing , 1991, PLDI '91.

[16]  Ken Kennedy,et al.  Parascope:a Parallel Programming Environment , 1988 .

[17]  David Grove,et al.  Selective specialization for object-oriented languages , 1995, PLDI '95.

[18]  Barbara G. Ryder,et al.  Region analysis: a parallel elimination method for data flow analysis , 1994, Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94).

[19]  David W. Binkley,et al.  Interprocedural slicing using dependence graphs , 1990, TOPL.

[20]  Elaine J. Weyuker,et al.  Selecting Software Test Data Using Data Flow Information , 1985, IEEE Transactions on Software Engineering.

[21]  Thomas J. Ostrand,et al.  Experiments on the effectiveness of dataflow- and control-flow-based test adequacy criteria , 1994, Proceedings of 16th International Conference on Software Engineering.

[22]  Barbara G. Ryder,et al.  Elimination algorithms for data flow analysis , 1986, CSUR.

[23]  David W. Binkley,et al.  Program slicing , 2008, 2008 Frontiers of Software Maintenance.

[24]  Jong-Deok Choi,et al.  Pointer-induced aliasing: a clarification , 1993, SIGP.

[25]  Barbara G. Ryder,et al.  A Critical Analysis of Incremental Iterative Data Flow Analysis Algorithms , 1990, IEEE Trans. Software Eng..