Article

Free access

How to analyze large programs efficiently and informatively

Authors:

Dhananjay M. Dhamdhere,

Barry K. Rosen,

F. Kenneth ZadeckAuthors Info & Claims

PLDI '92: Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation

Pages 212 - 223

https://doi.org/10.1145/143095.143135

Published: 01 July 1992 Publication History

PDF eReader

References

[1]

A.V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison- Wesley, 1986.

Digital Library

Google Scholar

[2]

J. Choi, R. Cytron, and j. Ferrante. Automatic construction of sparse data flow evaluation graphs. Conf. Rec. Eighteenth A CM Syrup. on Principles of Programming Langs., pages 55-66, January 1991.

Digital Library

Google Scholar

[3]

R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. Conf. Rec. Sixteenth A CM Syrup. on Principles of Programming Langs., pages 25-35, January 1989.

Digital Library

Google Scholar

[4]

B. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. A CM Trans. on Programming Langs. and Systems, 13(4):451-490, October 1991.

Digital Library

Google Scholar

[5]

F.C. Chow. A portable machine-independent global optimizer -design and measurements. Technical Report 83-254 (PhD Thesis), Computer Systems Laboratory, Stanford U. Stanford, CA, December 1983.

Digital Library

Google Scholar

[6]

F.C. Chow. Minimizing register usage penalty at procedure calls. Proc. $IGPLAN'88 Syrup. on Compiler Construction, pages 85-94, June 1988. Published as $IGPLAN Notices Vol. 23, No. 7.

Digital Library

Google Scholar

[7]

D.M. Dhamdhere. A fast algorithm for code movement optimization. SIGPLAN Notices, 9(3):243-273, August 1988.

Digital Library

Google Scholar

[8]

D.M. Dhamdhere. Practical adaptation of the global optimization algorithm of morel and renvoise. A CM Trans. on Programming Langs. and Systems, 13(2):291-294, April 1991.

Digital Library

Google Scholar

[9]

D.M. Dhamdhere and J. R. Isaac. A composite algorithm for strength reduction and code movement optimization. Int. J. of Computer and Information Sci., 23(10):172-180, 1980.

Digital Library

Google Scholar

[10]

D.M. Dhamdhere and H. Patil. An efficient algorithm for bidirectional data flow analysis. Technical Report TR-016-90, Dept. of Computer Sci. and Eng., Indian Inst. of Technology, 1990. Revision to appear in A CM Trans. on Programming Langs. and Systems.

Google Scholar

[11]

K.-H. Drechsler and M. P. Stadel. A solution to a problem with Morel and Renvoise's "Global Optimization by Suppression of Partial Redundancies''. A CM Trans. on Programming Langs. and Systems, 10(4):635-640, October 1988.

Digital Library

Google Scholar

[12]

M.S. Hecht and J. D. Ullman. A simple algorithm for global data flow analysis problems. SiAM J. Computing, 4(4):519-532, Dec. 1975.

Digital Library

Google Scholar

[13]

S.M. Joshi and D. M. Dhamdhere. A composite hoisting-strength reduction transformation for global program optimization (part I). Int. J. of Computer Math., pages 22-41, 1982.

Google Scholar

[14]

S.M. joshi and D. M. Dhamdhere. A composite hoisting-strength reduction transformation for global program optimization (part II). Int. Y. of Computer Math., pages 111-126, 1982.

Google Scholar

[15]

L.T. Kou. On live-dead analysis for global data flow problems. J. A CM, 24(3):473-483, July 1977.

Digital Library

Google Scholar

[16]

E. Morel and C. Renvoise. Global optimization by suppression of partial redundancies. Comm. ACM, 22(2):96-103, February 1979.

Digital Library

Google Scholar

[17]

T.J. Marlowe and B. G. Ryder. An efficient hybrid algorithm for incremental data flow analysis. Conf. Rec. Seventeenth A CM Syrup. on Principles of Programming Langs., pages 184- 196, January 1990.

Digital Library

Google Scholar

[18]

B.K. Rosen. Degrees of availability as an introduction to the general theory of data flow analysis, in S. S. Muchnick and N. D. Jones, editors, Program Flow Analysis, chapter 2, pages 55-76. Prentice Hall, 1981.

Google Scholar

[19]

B.K. Rosen, M. N. Wegman, and F. K. Zadeck. Global value numbers and redundant computations. Conf. Rec. Fifteenth A CM Syrup. on Principles of Programming Langs., pages 12-27, January 1988.

Digital Library

Google Scholar

[20]

A. Sorkin. Some comments on "A Solution to a Problem with Morel and Renvoise's 'Global Optimization by Suppression of Partial Redundancies' ". A CM Trans. on Programming Langs. and Systems, 11(4):666-668, October 1989.

Digital Library

Google Scholar

[21]

F.K. Zadeck. Incremental data flow analysis in a structure program editor. Proc. $IGPLAN'84 Syrup. on Compzler Construction, pages 132-143, June 1984. PubIished as SIGPLAN Notices Vol. 19, No. 6.

Digital Library

Google Scholar

Cited By

View all

Jaiswal SKhedker UChakraborty S(2020)Bidirectionality in flow-sensitive demand-driven analysisScience of Computer Programming10.1016/j.scico.2020.102391(102391)Online publication date: Jan-2020
https://doi.org/10.1016/j.scico.2020.102391
Rahibb Sarala S(2020)A Supplement to “PRE: A Simple, Pragmatic, and Provably Correct Algorithm”Advances in Electrical and Computer Technologies10.1007/978-981-15-5558-9_8(77-81)Online publication date: 8-Sep-2020
https://doi.org/10.1007/978-981-15-5558-9_8
Oh HHeo KLee WLee WPark DKang JYi K(2014)Global Sparse Analysis FrameworkACM Transactions on Programming Languages and Systems10.1145/259081136:3(1-44)Online publication date: 25-Sep-2014
https://dl.acm.org/doi/10.1145/2590811
Show More Cited By

Index Terms

How to analyze large programs efficiently and informatively
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
    2. General programming languages
      1. Language features
        Control structures
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs

Recommendations

Overlaying multiple maps efficiently
CIT'04: Proceedings of the 7th international conference on Intelligent Information Technology

Spatial data is often represented as layers of thematic maps. User queries often necessiate overlay operations involving these maps. Map overlay is an extensively used operation in GIS. Typical two-map overlay involves operations on a large number of ...
Using a Combination Method of MDS and SOM to Visually Analyze Postpartum Depression Domain
COMPSAC '15: Proceedings of the 2015 IEEE 39th Annual Computer Software and Applications Conference - Volume 03

This study focused on a combination method that included MDS and SOM to visually reveal research topics in postpartum depression research domain from the bibliographic point of view. 391 documents which were under postpartum depression domain were used ...
Using knowledge space theory to analyze concept maps
ICLS '10: Proceedings of the 9th International Conference of the Learning Sciences - Volume 1

This study examines use of knowledge space theory as a novel method of analyzing concept maps. Concept mapping is a technique for expressing relationships between ideas, using two-dimensional node-link diagrams to visually display relationships between ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PLDI '92: Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation

July 1992

352 pages

ISBN:0897914759

DOI:10.1145/143095

Chairman:
Stuart I. Feldman
Bell Communications Research, Morristown, NJ
,
Editor:
Richard L. Wexelblat

ACM SIGPLAN Notices Volume 27, Issue 7
July 1992
352 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/143103
Editor:
Richard Wexelblat
IDA/CDED, Alexandria, VA
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PLDI92

Sponsor:

SIGPLAN

PLDI92: SIGPLAN 92 Conference on Programming Language Design and Implmentation

June 15 - 19, 1992

California, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 406 of 2,067 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

71
Total Citations
View Citations
638
Total Downloads

Downloads (Last 12 months)74
Downloads (Last 6 weeks)19

Reflects downloads up to 01 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jaiswal SKhedker UChakraborty S(2020)Bidirectionality in flow-sensitive demand-driven analysisScience of Computer Programming10.1016/j.scico.2020.102391(102391)Online publication date: Jan-2020
https://doi.org/10.1016/j.scico.2020.102391
Rahibb Sarala S(2020)A Supplement to “PRE: A Simple, Pragmatic, and Provably Correct Algorithm”Advances in Electrical and Computer Technologies10.1007/978-981-15-5558-9_8(77-81)Online publication date: 8-Sep-2020
https://doi.org/10.1007/978-981-15-5558-9_8
Oh HHeo KLee WLee WPark DKang JYi K(2014)Global Sparse Analysis FrameworkACM Transactions on Programming Languages and Systems10.1145/259081136:3(1-44)Online publication date: 25-Sep-2014
https://dl.acm.org/doi/10.1145/2590811
Oh HHeo KLee WLee WYi K(2012)Design and implementation of sparse global analyses for C-like languagesACM SIGPLAN Notices10.1145/2345156.225409247:6(229-238)Online publication date: 11-Jun-2012
https://dl.acm.org/doi/10.1145/2345156.2254092
Oh HHeo KLee WLee WYi KVitek JLin HTip F(2012)Design and implementation of sparse global analyses for C-like languagesProceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/2254064.2254092(229-238)Online publication date: 11-Jun-2012
https://dl.acm.org/doi/10.1145/2254064.2254092
Rountev AKagan SMarlowe T(2006)Interprocedural dataflow analysis in the presence of large librariesProceedings of the 15th international conference on Compiler Construction10.1007/11688839_2(2-16)Online publication date: 30-Mar-2006
https://dl.acm.org/doi/10.1007/11688839_2
Gupta MSchonberg ESrinivasan H(2005)A unified data-flow framework for optimizing communicationLanguages and Compilers for Parallel Computing10.1007/BFb0025884(266-282)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0025884
Bodík RGupta R(2005)Array data flow analysis for load-store optimizations in superscalar architecturesLanguages and Compilers for Parallel Computing10.1007/BFb0014188(1-15)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0014188
Geser AKnoop JLüttgen GRüthing OSteffen B(2005)Non-monotone fixpoint iterations to resolve second order effectsCompiler Construction10.1007/3-540-61053-7_56(106-118)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-61053-7_56
Alt MMartin F(2005)Generation of efficient interprocedural analyzers with PAGStatic Analysis10.1007/3-540-60360-3_31(33-50)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-60360-3_31
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Overlaying multiple maps efficiently

Using a Combination Method of MDS and SOM to Visually Analyze Postpartum Depression Domain

Using knowledge space theory to analyze concept maps