Program optimization and exception handling

ABSTRACT

Optimization of programs that may contain exception handling facilities requires new techniques. Program optimizations that do not account for exception handling facilities may incorrectly transform a procedure that can raise an exception, producing different results from the unoptimized version. Restricted exception handling mechanisms that allow optimization are discussed. Data flow equations for determining the effects of exception handling are presented.

REFERENCES

• 1: Alfred V. Aho , Jeffrey D. Ullman, Principles of Compiler Design (Addison-Wesley series in computer science and information processing), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1977
• 2: John P. Banning, An efficient way to find the side effects of procedure calls and the aliases of variables, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.29-41, January 29-31, 1979, San Antonio, Texas [doi>10.1145/567752.567756]
• 3: Jeffrey M. Barth, A practical interprocedural data flow analysis algorithm, Communications of the ACM, v.21 n.9, p.724-736, Sept. 1978 [doi>10.1145/359588.359596]
• 4: John B. Goodenough, Exception handling: issues and a proposed notation, Communications of the ACM, v.18 n.12, p.683-696, Dec. 1975 [doi>10.1145/361227.361230]
• 5: Liskhov, B. H. and Synder A. "Exception Handling in CLU." IEEE Trans. on Software Engineering SE-5, 6 (Nov 1979), 547-557.
• 6: Mitchell, J. G., Maybury, W. and Sweet, R. Mesa Language Manual Version 5. Xerox Palo Alto Research Center, Palo Alto, Ca., 1979.
• 7: OS PL/I Checkout and Optimizing Compilers: Language Reference Manual. IBM Corporation, 1979.
• 8: Spillman, T. C. Exposing Side-Effects in a PL/I Optimizing Compiler. Proceedings of the IFIP Congress 1971, Amsterdam, 1971, pp. 376-381.