Bidirectional data flow analysis for type inferencing

Computer Languages, Systems and Structures

Volumn 29, Issue 1-2, 2003, Pages 15-44

  Khedker, Uday P ^a   Dhamdhere, Dhananjay ^a   Mycroft, Alan ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Bidirectional data flow analysis; Type inferencing

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; FUNCTIONS; PROGRAM COMPILERS; THEOREM PROVING;

CONSTRAINT-BASED ANALYSIS; TYPE INFERENCING;

DATA FLOW ANALYSIS;

EID: 0347354962     PISSN: 14778424     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1477-8424(03)00012-5     Document Type: Article

References (46)

1. Tennenbaum AM. Type determination in very high level languages. Technical report NSO-3, Courant Institute of Mathematical Sciences, New York University, 1974.
2. Aho A.V., Sethi R., Ullman J.D. Compilers - principles, techniques, and tools. 1986;Addison-Wesley, Reading MA.
3. Morel E., Renvoise C. Global optimization by suppression of partial redundancies. Communications of ACM. 22(2):1979;96-103.
4. Khedker UP. A generalized theory of bit vector data flow analysis. PhD thesis, Department of Computer Science and Engineering, Indian Institute of Technology, Bombay, 1997.
5. Khedker U.P., Dhamdhere D.M. A generalized theory of bit vector data flow analysis. ACM Transactions on Programming Languages and Systems. 16(5):1994;1472-1511.
6. Khedker U.P. Data flow analysis. Srikant Y.N., Shankar P. The compiler design handbook: optimizations & machine code generation. 2002;CRC Press, USA.
7. Hecht M.S. Flow analysis of computer programs. 1977;Elsevier, North-Holland Inc. Amsterdam.
8. Kam J.B., Ullman J.D. Monotone data flow analysis frameworks. Acta Informatica. 7(3):1977;305-318.
9. Kildall G. A unified approach to global program optimization. In: Proceedings of the First Annual ACM Symposium on Principles of Programming Languages, 1973. p. 194-206.
10. Marlowe T.J., Ryder B.G. Properties of data flow frameworks. Acta Informatica. 28:1990;121-163.
11. Rosen B.K. Monoids for rapid data flow analysis. SIAM Journal of Computing. 9(1):1980;159-196.
12. Dhamdhere DM, Khedker UP. Complexity of bidirectional data flow analysis. In: Proceedings of the 20th Annual ACM Symposium on Principles of Programming Languages, 1993. p. 397-408.
13. Cardelli L, Wegner P. Handbook of computer science and engineering. Boca Raton, FL: CRC Press, 1997 [chapter Type Systems].
14. Hindley R. The principal type-scheme of an object in combinatory logic. Transactions of the American Mathematical Society. 146:1969;29-60.
15. Milner R. A theory of polymorphism in programming. Journal of Computer Systems and Sciences. 17(3):1978;348-375.
16. Cardelli L., Wegner P. On understanding types, data abstraction, and polymorphism. ACM Computing Surveys. 17(4):1985;471-522.
17. Nielson HR, Nielson F. Flow logics for constraint based analysis. In: Proceedings of CC '98, Lecture Notes in Computer Science, vol. 1383. Berlin: Springer, 1998. p. 109-27.
18. Aiken A, Murphy BR. Static type inference in a dynamically typed language. In: Proceedings of the 18th Annual ACM Symposium on Principles of Programming Languages, 1991. p. 279-90.
19. Aiken A, Wimmers EL, Lakshman TK. Soft typing with conditional types. In: Proceedings of the 21th Annual ACM Symposium on Principles of Programming Languages, 1994. p. 163-73.
20. Chambers C, Ungar D. Iterative type analysis and extended message splitting: optimizing dynamically-typed object-oriented programs. In: Proceedings of ACM SIGPLAN '90 Conference on Programming Language Design and Implementation, 1990. p. 150-62 (also Published as SIGPLAN Notices, 25(6)).
21. Oxh ø j N, Palsberg J, Schwartzbach MI. Making type inference practical. In: Proceedings of 6th European Conference on Object Oriented Programming (ECOOP '92), Lecture Notes in Computer Science, vol. 615. Berlin: Springer, 1992. p. 329-49.
22. Abadi M., Cardelli L., Pierce B., Plotkin G. Dynamic typing in a statically typed language. ACM Transactions on Programming Languages and Systems. 13(2):1991;237-268.
23. Abadi M, Cardelli L, Pierce B, Remy D. Dynamic typing in polymorphic languages. In: ACM SIGPLAN Workshop on ML and its Applications. Technical report CMU-CS-92-105, School of Computer Science, Carnegie Mellon University, 1992.
24. Cartwright R, Fagan M. Soft typing. In: Proceedings of ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, 1991. p. 278-92 (also Published as SIGPLAN Notices, 26(6)).
25. Palsberg J, O'Keefe P. A type system equivalent to flow analysis. In: Proceedings of the 22nd Annual ACM Symposium on Principles of Programming Languages, 1995. p. 367-78.
26. Barnard AJ. From types to dataflow: code analysis for an object oriented language. PhD thesis, Department of Computer Science, University of Manchester, 1993.
27. Dhamdhere D.M. A fast algorithm for code movement optimization. ACM SIGPLAN Notices. 23(10):1988;172-180.
28. Dhamdhere DM, Rosen BK, Zadeck FK. How to analyze large programs efficiently and informatively. In: Proceedings of ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, 1992. p. 212-23 (also Published as SIGPLAN Notices, 27(7)).
29. Wolfe M. Partial redundancy elimination is not bidirectional. ACM SIGPLAN Notices. 36(4):1999;43-46.
30. Drechsler K., Stadel M.P. A solution to a problem with Morel and Renvoise's "Global optimizations by suppression of partial redundancies" ACM Transactions on Programming Languages and Systems. 10(4):1988;635-640.
31. Khedker U.P., Dhamdhere D.M. Bidirectional data flow analysis. myths and reality ACM SIGPLAN Notices. 36(4):1999;47-57.
32. Briggs P, Kooper KD. Effective partial redundancy elimination. In: Proceedings of ACM SIGPLAN '94 Conference on Programming Language Design and Implementation, 1994. p. 159-70 (also Published as SIGPLAN Notices, 29(6)).
33. Dhamdhere D.M., Patil H. An elimination algorithm for bidirectional data flow analysis using edge placement technique. ACM Transactions on Programming Languages and Systems. 15(2):1993;312-336.
34. Dhaneshwar V., Dhamdhere D.M. Strength reduction of large expressions. Journal of Programming Languages. 3:1995;95-120.
35. Drechsler K., Stadel M.P. A variation of knoop, ruthing, and steffen's lazy code motion. ACM SIGPLAN Notices. 28(5):1993;29-38.
36. Hailperin M. Cost-optimal code motion. ACM Transactions on Programming Languages and Systems. 20(6):1998;1297-1322.
37. Hanxleden R, Kennedy K. GIVE-N-TAKE - a balanced code placement framework. In: Proceedings of ACM SIGPLAN '94 Conference on Programming Language Design and Implementation, 1994. p. 107-20 (also Published as SIGPLAN Notices, 29(6)).
38. Knoop J, Rüthing O, Steffen B. Lazy code motion. In: Proceedings of ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, 1992. p. 224-34 (also Published as SIGPLAN Notices, 27(7)).
39. Knoop J., Rüthing O., Steffen B. Optimal code motion. ACM Transactions on Programming Languages and Systems. 16(4):1994;1117-1155.
40. Knoop J, Rüthing O, Steffen B. Partial dead code elimination. In: Proceedings of ACM SIGPLAN '94 Conference on Programming Language Design and Implementation, 1994. p. 147-58 (also Published as SIGPLAN Notices, 29(6)).
41. Knoop J., Rüthing O., Steffen B. Lazy strength reduction. Journal of Programming Languages. 1(1):1993;71-91.
42. Knoop J, Rüthing O, Steffen B. The power of assignment motion. In: Proceedings of ACM SIGPLAN '95 Conference on Programming Language Design and Implementation, 1995. p. 233-45 (also Published as SIGPLAN Notices, 30(6)).
43. Paleri V.K., Srikant Y.N., Shankar P. A simple algorithm for partial redundancy elimination. ACM SIGPLAN Notices. 33(12):1998;35-43.
44. Muchnick S.S. Advanced compiler design and implementation. 1997;Morgan Kaufmann Publishing Co. Los Altos, CA.
45. Rüthing O. Bidirectional data flow analysis in code motion: myth and reality. In: Proceedings of International Static Analysis Symposium (SAS '98), Lecture Notes in Computer Science, vol. 1503. Berlin: Springer, 1998.
46. Rüthing O. Interacting code motion transformations: their impact and their complexity. Lecture Notes in Computer Science. vol. 1539:1998;Springer, Berlin