LOOP MONOTONIC STATEMENTS

被引:16
|
作者
SPEZIALETTI, M [1 ]
GUPTA, R [1 ]
机构
[1] UNIV PITTSBURGH,DEPT COMP SCI,PITTSBURGH,PA 15260
基金
美国国家科学基金会;
关键词
ACCESS ANOMALIES (DATA RACES); ARRAY BOUND CHECKING; RUN-TIME DEPENDENCE CHECKING; STATIC ANALYSIS; INDUCTION VARIABLES;
D O I
10.1109/32.391376
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A statement is considered to be monotonic with respect to a loop if its execution, during the successive iterations of a given execution of the loop, assigns a monotonically increasing or decreasing sequence of values to a variable. We present static analysis techniques to identify loop monotonic statements. The knowledge of loop monotonicity characteristics of statements which compute array subscript expressions is of significant value in a number of applications. We illustrate the use of this information in improving the efficiency of run-time array bound checking, run-time dependence testing, and on-the-fly detection of access anomalies. Given that a significant percentage of subscript expressions are monotonic, substantial savings can be expected by using these techniques.
引用
收藏
页码:497 / 505
页数:9
相关论文
共 50 条