Program Graphs, an Algebra, and Their Implication for Programming

IEEE Transactions on Software Engineering

Volumn SE-1, Issue 3, 1975, Pages 286-291

  Paige, Michael R ^a  

^a Unisys   (United States)

Author keywords

Partitioning; program graphs; program structure; structured programming

Indexed keywords

COMPUTER METATHEORY;

EID: 0016557156     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1975.6312853     Document Type: Article

References (17)

1. E. W. Dijkstra, “The structure of the THE multiprogramming system,” Commun. Ass. Comput. Mach., vol. 11, pp. 341–346, May 1968.
2. “A constructive approach to the problem of program correctness,” BIT, vol. 8, pp. 174–186, 1968.
3. “Structured programming,” in Software Engineering Techniques, Buxton and Randell, Ed., NATO Sci. Committee, Oct. 1969, pp. 84–88.
4. “GO;O statement considered harmful,” Commun. Ass. Comput. Mach., vol. 11, pp. 147–148, Mar. 1968.
5. H. D. Mills, “Structured programming in large systems,” in Debuggi'(lg Techniques in Large Systems, Hetzel, Ed. Englewood Cliffs, N. J.: Prentice-Hall, 1971.
6. “On the development of large reliable programs,” in Proc. 1973 IEEE Symp. Comput. Software Reliability, pp. 155–159.
7. R. M. Karp, “A note on the application of graph theory to digital computer programming,” Inform. Contr., vol. 3, pp. 179–190, 1960.
8. R. B. Marimont, “Applications of graphs and Boolean matrices to computer programming,”. SIAM Rev., vol. 2, pp. 259–268, Oct. 1960.
9. M. R. Paige , “Structural techniques of program validation,” presented at the COMPCON IEEE Computer Society Int. Conf., San Francisco, Calif., Feb. 1974.
10. J. R. Brown , “Automated software quality assurance–A case study of three systems,” jn Program Test Methods, Hetzel, Ed. Englewood Cliffs, N. J.: Prentice-Hall, 1973.
11. L. G. Stucki, “Automatic generation of self-metric software,” in Proc. 1973 IEEE Symp. Comput. Software Reliability, pp. 94–100.
12. C. V. Ramamoorthy , “Design and construction of an automated software evaluation system,” in Proc. 1973 IEEE Symp. Comput. Software Reliability, pp. 28–37.
13. M. R. Paige and G. Benson, “The use of software probes in testing Fortran programs,” Computer, pp. 40–47, July 1974.
14. C. Bohm and G. Jacopini, “Flow diagrams, Turing machines and languages with only two formation rules,” Commun. Ass. Comput. Mach., vol. 9, pp. 366–371, May 1968.
15. M. Hecht and J. D. Ullman, “Flowgraph reducibility,” SIAM J., vol. 1, pp. 188–202, June 1972.
16. B. Liskov and E. Towster, “The proof of correctness approach to reliable systems,” MITRE Rep. MTR-2073, July 1971.
17. J. Hopcroft and R. Tarjan, “Efficient algorithms for graph manipulation,” Stanford University, Stanford, Calif., STANC8– 71-207, Mar. 1971.