Abstract
This paper tries to provide a general and formal method for the program static analysis. For this purpose, a projecting model of directed graph is developed. The regularity of control flow and data flow as well as programs are defined. How to analyse the programs by means of projecting is discussed.
The method proposed here is called “projecting technique”, which has been successfully used in a fine automated analysis system for FORTRAN programs. It appears more general, simpler and more flexiable than those methods proposed before.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W.T. Chen and C.V. Ramamoorthy, Automated techniques for static structural validation of programs, The IEEE Computer Society's Proc. of the First International Computer Software on Applications Conference, 1977, 628–634.
L.D. Fosdick and L.J. Osterweil, The detection of anomalous interprocedure data flow, Proc. of the 2nd International Conference on Software Engineering, 1977, 624–628.
J. Horejs, Finite semantics: a technique for program testing, Proc, of the 4th International Conference on Software Engineering, 1979, 433–440.
Hou Loming, FATAS—an Automated analysis system for FORTRAN programs,Computer Research and Development,23:4(1986), 26–30.
Jin Chengzhi, The Compiler Technique for ALGOL60, Published by Science Press, Beijing, China, 1983.
G.J. Myers, The Art of Software Testing, John Wiley and Sons Inc., New York, 1979.
E.F. Miller, Program testing technology in the 1980's, Proc. of the Conf. on Computing in the 1980's, 1981, 72–79.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hou, L. A general and formal method for the program static analysis. J. of Comput. Sci. & Technol. 2, 115–123 (1987). https://doi.org/10.1007/BF02973489
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02973489