1. Aho, A. V.; and Ullman, J. D. “Node listings for reducible flow graphs,” in Proc. of the 7th Annual ACM Symposium on Theory of Computing, 1975, pp. 177–185.
2. Allen, F.E. “Program optimization,” in Annual Review in Automatic Programming, 1969.
3. Allen, F.E. “A basis for program optimization,” in Proc. IFIP Congress 1971, North-Holland Publ. Co., Amsterdam, The Netherlands, 1972, pp. 385–390.
4. Allen, F. E.; and Cocke, J. Graph-theoretic constructs for program control flow analysis, IBM Research Report RC3923, T. J. Watson Research Center, 1972.
5. Allen, F. E. “Interprocedural data flow analysis,” in Proc. IFIP Congress 1974, North Holland Publ. Co., Amsterdam, The Netherlands, 1974, pp. 398–402.