Abstract
Whereas the construction process of a compiler for the early and late phases like syntactic analysis and code generation is well-supported by powerful tools, the optimizer, the key component for achieving highly efficient code is usually still hand-coded. The tool kit presented here supports this essential step in the construction of a compiler. The two key features making it exceptional are (1) that it automatically generates global program analyses for intraprocedural, interprocedural and parallel data flow problems, and (2) that it supports the combination of the results obtained to program optimizations.
Chapter PDF
Similar content being viewed by others
References
Alt, M., and Martin, F. Generation of efficient interprocedural analyzers with PAG. In Proc. 2nd Internat. Static Analysis Symposium (SAS'95), Glasgow, UK, Springer-Verlag, LNCS 983 (1995), 33–50.
Davidson, J. W., and Fraser, C. W. Automatic generation of peephole transformations. In Proc. ACM SIGPLAN'84 Symp. on Comp. Construct., Montreal, Canada, SIGPLAN Notices 19, 6 (1984), 111–115.
Kessler, R. R. Peep — An architectural description driven peephole transformer. In Proc. ACM SIGPLAN'84 Symp. on Comp. Construct., Montreal, Canada, SIGPLAN Notices 19, 6 (1984), 106–110.
Knoop, J., Rüthing, O., and Steffen, B. Optimal code motion: Theory and practice. Transactions on Programming Languages and Systems 16, 4 (1994), 1117–1155.
Knoop, J., Rüthing, O., and Steffen, B. The power of assignment motion. In Proc. ACM SIGPLAN'95 Conf. on Programming Language Design and Implementation (PLDI'95), La Jolla, California, SIGPLAN Notices 30, 6 (1995), 233–245.
Knoop, J., and Steffen, B. The interprocedural coincidence theorem. In Proc. 4 th Internat. Conference on Compiler Construction (CC'92), Paderborn, Germany, Springer-Verlag, LNCS 641 (1992), 125–140.
Knoop, J., Steffen, B., and Vollmer, J. Parallelism for free: Efficient and optimal bitvector analyses for parallel programs. Accepted for Transactions on Programming Languages and Systems.
Knoop, J., Steffen, B., and Vollmer, J. Parallelism for free: Bitvector analyses ⇒ No state explosion! In Proc. 1 st Internat. Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'95), Springer-Verlag, LNCS 1019 (1995), 264–289.
Steffen, B. Generating data flow analysis algorithms from modal specifications. Science of Computer Programming 21, (1993), 115–139.
Steffen, B., Cla\en, A., Klein, M., Knoop, J., and Margaria, T. The fixpoint-analysis machine. In Proc. 6 th Internat. Conference on Concurrency Theory (CONCUR'95), Philadelphia, Pennsylvania, Springer-Verlag, LNCS 962 (1995), 72–87.
Venkatesh, G. V., and Fischer, C. N. Spare: A development evironment for program analysis algorithms. In IEEE Transactions on Software Engineering 18, 4 (1992), 304–318.
Whitfield, D., and Soffa, M. L. Automatic generation of global optimizers. In Proc. ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI'91), Toronto, Ontario, Canada, SIGPLAN Notices 26, 6 (1991), 120–129.
Yi, K., and Harrison III, W. L. Automatic generation and management of interprocedural program analyses. In ACM SIGPLAN-SIGACT, (Jan. 1993).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klein, M., Koschützki, D., Knoop, J., Steffen, B. (1996). DFA&OPT-MetaFrame: A tool kit for program analysis and optimization. In: Margaria, T., Steffen, B. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 1996. Lecture Notes in Computer Science, vol 1055. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61042-1_64
Download citation
DOI: https://doi.org/10.1007/3-540-61042-1_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61042-7
Online ISBN: 978-3-540-49874-2
eBook Packages: Springer Book Archive