zbMATH — the first resource for mathematics

A strong-connectivity algorithm and its applications in data flow analysis. (English) Zbl 0443.68046

68R10 Graph theory (including graph drawing) in computer science
68N99 Theory of software
Full Text: DOI
[1] Aho, A.U.; Hopcroft, J.E.; Ullman, J.D., The design and analysis of computer algorithms, (1974), Addison-Wesley Reading, Mass · Zbl 0326.68005
[2] Hecht, M.S.; Ullman, J.D., A simple algorithm for global data flow analysis problems, SIAM J. computing, 4, 519-532, (1975) · Zbl 0329.68039
[3] Kennedy, K.W., Node listings applied to data-flow analysis, Proc. 2nd symp. on the principles of programming languages, 10-21, (1975), Palo-Alto, California · Zbl 0357.68017
[4] Karo, J.B.; Ullman, J.D., Global data flow analysis and iterative algorithms, Jacm, 23, 158-171, (1976) · Zbl 0315.68031
[5] Schwartz, J.T.; Sharir, M., A design for optimizations of the bitvectoring class, () · Zbl 0676.68086
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.