R. Gupta and M. Spezialetti. Loop monotonic computations: An approach for the efficient run-time detection of races. In ACM Symp. on Testing Analysis and Verification, pages 98--111, 91. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Beyond Induction Variables: Detecting and Classifying.. - Gerlek, Stoltz, Wolfe (1995) (62 citations) (Correct)
....ways of extending the class of sequences usually detected. Spezialetti and Gupta have extended the traditional dataflow approach to classify monotonic statements for such diverse applications as run time array bounds checking, dependence analysis, and run time detection of access anomalies [Gupta and Spezialetti 1991]. Their technique uses an iterative algorithm to detect basic and dependent monotonic statements in loops which are not nested, including both regular (arithmetic, geometric) and irregular monotonic sequences. Our demand driven treatment is at least as powerful, and although still iterative ....
Gupta, R. and Spezialetti, M. 1991. Loop monotonic computations: An approach for the efficient run-time detection of races. In Proceedings of the SIGSOFT Symposium on Testing, Analysis, and Verification, pp. 98--111.
Beyond Induction Variables: Detecting and Classifying Sequences.. - Gerlek (1996) (62 citations) (Correct)
....ways of extending the class of sequences usually detected. Gupta and Spezialetti have extended the traditional data flow approach to classify monotonic statements for such diverse applications as run time array bounds checking, dependence analysis, and run time detection of access anomalies [11]. Their technique uses an iterative algorithm to detect basic and dependent monotonic statements in loops which are not nested, including both regular (arithmetic, geometric) and irregular monotonic sequences. Our demand driven treatment is at least as powerful, and although it is still ....
R. Gupta and M. Spezialetti. Loop monotonic computations: An approach for the efficient run-time detection of races. In Proceedings of the SIGSOFT Symposium on Testing, Analysis, and Verification, 98--111. ACM Press, New York, October 1991.
Beyond Induction Variables: Detecting and Classifying.. - Gerlek, Stoltz, Wolfe (1995) (62 citations) (Correct)
....predicate information is needed. Other current work by Havlak and others may address the use of fl functions for this purpose [Havlak 1993; Stoltz et al. 1994b] 7.2 Sequence Detection Recently, other researchers have considered various ways of extending the class of sequences usually detected. Gupta and Spezialetti [1991] have extended the traditional data flow approach to classify monotonic statements for such diverse applications as run time array bounds checking, dependence analysis, and run time detection of access anomalies. Their technique uses an iterative algorithm to detect basic and dependent ....
Gupta, R. and Spezialetti, M. 1991. Loop monotonic computations: An approach for the efficient run-time detection of races. In Proceedings of the SIGSOFT Symposium on Testing, Analysis, and Verification. ACM Press, New York, 98--111.
Optimizing Array Bound Checks Using Flow Analysis - Gupta (1993) (32 citations) Self-citation (Gupta) (Correct)
....to take advantage of monotonic definitions because the definitions of variables used in subscript expressions are very often monotonic. In this work we use a simple approach for detecting monotonic definitions. A more general algorithm for detecting monotonic computations can be found in [6]. The affect of B on variable v is summarized by AFFECT (B ,v ) as shown below. Here v be f ore and v a f ter denote the values of variable v before and after a block and c is a positive compiletime constant. AFFECT (B ,v ) # # # # # # # # # # # changed : div 1 : div 1 : multiply : ....
R. Gupta and M. Spezialetti, "Loop Monotonic Computations: An Approach for the Efficient Run-time Detection of Races," Proc. of the SIGSOFT Symposium on Testing, Analysis, and Verification, Victoria, Canada, pp. 98-111, October 1991.
Dependence Testing without Induction Variable Substitution - Cohen, Wu (Correct)
No context found.
R. Gupta and M. Spezialetti. Loop monotonic computations: An approach for the efficient run-time detection of races. In ACM Symp. on Testing Analysis and Verification, pages 98--111, 91.
Monotonic Evolution: an Alternative to Induction.. - Wu, Cohen.. (2001) (3 citations) (Correct)
No context found.
R. Gupta and M. Spezialetti. Loop monotonic computations: An approach for the efficient run-time detection of races. In ACM Symp. on Testing Analysis and Verification, pages 98--111, 91.
Dependence Testing without Induction Variable Substitution - Cohen, Wu (2001) (Correct)
No context found.
R. Gupta and M. Spezialetti. Loop monotonic computations: An approach for the efficient run-time detection of races. In ACM Symp. on Testing Analysis and Verification, pages 98--111, 91.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC