On the power and limitations of strictness analysis

Journal of the ACM

Volumn 44, Issue 3, 1997, Pages 505-525

  Sekar, R ^a   Ramakrishnan, I V ^b,c   Mishra, P ^b,c  

^a IOWA STATE UNIVERSITY   (United States)

^b STONY BROOK UNIVERSITY   (United States)

^c Stony Brook University   (United States)

Author keywords

Abstract interpretation; Completeness; Languages; Measurement; Program analysis; Strictness analysis; Theory

Indexed keywords

PROGRAMMING THEORY;

ABSTRACT INTERPRETATION; APPLICATIVE LANGUAGES; COMPILERS; STRICTNESS ANALYSIS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0031140213     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/258128.258212     Document Type: Article

References (20)

1. AUGUSTSSON, L. 1984. A compiler for lazy ML. In Proceedings of the 1984 ACM Conference on LISP and Functional Programming. ACM, New York, pp. 218-227.
2. BURN, G., HANKIN, C., AND ABRAMSKY, S. 1985. Theory and practice of strictness analysis for higher order functions. In Workshop on Programs as Data Objects, N. Jones and H. Ganzinger, eds. Lecture Notes in Computer Science, vol 217. Springer-Verlag, New York.
3. CLACK, C., AND JONES, S. P. 1985. Strictness analysis - A practical approach. In Functional Programming and Computer Architecture. Lecture Notes in Computer Science, vol 20. Springer-Verlag, New York, 35-49.
4. COUSOT, P., AND COUSOT, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the 4th ACM Symposium on Principles of Programming Languages (Los Angeles, Calif., Jan. 17-19). ACM, New York, pp. 238-252.
5. ERNOULT, C., AND MYCROFT, A. 1995. Untyped Strictness Analysis. J. Funct. Prog. 5, 1 (Jan), 38-50.
6. HALL, C. V., AND WISE, D. S. 1987. Compiling strictness into streams. In Proceedings of the 14th Annual ACM Symposium on Principles of Programming Languages (Munich, West Germany, Jan. 21-23). ACM, New York, pp. 132-143.
7. HUDAK, P., AND YOUNG, J. 1986. Higher-order strictness analysis for untyped lambda calculus. In Proceedings of the 13th Annual ACM Symposium on Principles of Programming Languages (St. Petersburg Beach, Fla., Jan. 13-15). ACM, New York, pp. 97-109.
8. HUET, G., AND LEVY, J. 1979. Computations in nonambiguous linear term rewriting systems. Tech. Rep. 359, IRIA, Le Chesney, France.
9. HUGHES, R., AND WADLER, P. 1987. Projections for strictness analysis. In Functional Programming and Computer Architecture. Lecture Notes in Computer Science, vol 27. Springer-Verlag, New York, pp. 385-407.
10. HUNT, S., AND HANKIN, C. 1991. Fixed points and frontiers: a new perspective. In J. Funct. Prog. 1, 1, (Jan.), 91-120.
11. KASER, O., PAWAGI, S., RAMAKRISHNAN, C. R., RAMAKRISHNAN, I. V., AND SEKAR, R. C. 1992. Fast parallel implementation of functional languages - The EQUALS experience. In Proceedings of the 1992 ACM Conference on LISP and Functional Programming (San Francisco, Calif., June 22-24). ACM, New York, pp. 335-344.
12. KUO, T., AND MISHRA, P. 1989. Strictness analysis: A new perspective based on type inference. In Proceedings of the 4th International Conference on Functional Programming Languages and Computer Architecture (London, England, Sept. 11-13). ACM, New York, pp. 260-272.
13. MYCROFT, A. 1980. The theory and practice of transforming call-by-need into call-by-value. In International Symposium on Programming. Lecture Notes in Computer Science, vol 8. Springer-Verlag, New York, pp. 269-281.
14. MYCROFT, A. 1993. Completeness and predicate-based abstract interpretation. In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (Copenhagen, Denmark, June 14-16). ACM, New York, pp. 179-185.
15. RAMAKRISHNAN, C., RAMAKRISHNAN, I., AND SEKAR, R. 1995. A symbolic constraint-solving framework for analysis of logic programs. In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation. ACM, New York, pp. 12-23.
16. REDDY, U., AND KAMIN, S. 1992. On the power of abstract interpretation. In IEEE International Conference on Computer Languages. IEEE, New York, pp. 24-33.
17. SEKAR, R., MISHRA, P., AND RAMAKRISHNAN, I. 1991. On the power and limitation of strictness analysis based on abstract interpretation. In Proceedings of the 18th Annual ACM Symposium on Principles of Programming Languages (Orlando, Fla., Jan. 21-23). ACM, New York, pp. 37-48.
18. SEKAR, R., AND RAMAKRISHNAN, I. 1993. Beyond strong sequentially. Inf. Comput. 104, 1 (May), 78-109.
19. SEKAR, R., AND RAMAKRISHNAN, I. 1995. Fast strictness analysis based on demand propagation. ACM Trans. Prog. Lang. Syst. 17, 6 (Nov.), 896-937.
20. WADLER, P. 1987. Strictness analysis on non-flat domains (by abstract interpretation over finite domains). In Abstract Interpretation of Declarative Languages, S. Abramsky and C. Hankin, eds. Ellis Horwood, Chichester, U.K., 266-275.