This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Some Properties Derived from Structural Analysis of Program Graph Models
March 1983 (vol. 9 no. 2)
pp. 172-178
R.M. Negrini, Dipartimento di Elettronica, Politecnico di Milano
It is considered interesting to identify, from the structure of control flow and of relationships among variables in a program, some properties allowing to point out possible sources of errors or of faulty behavior. In particular, it is found that information about termination of loops and about meaningfulness of acceptance tests in recopery block strategy can be extracted from such structural analysis. Criteria for applying this analysis to programs with arbitrary structures are presented.
Index Terms:
structural termination, Program graph models, program testing, structural dependence
Citation:
R.M. Negrini, M. Sami, "Some Properties Derived from Structural Analysis of Program Graph Models," IEEE Transactions on Software Engineering, vol. 9, no. 2, pp. 172-178, March 1983, doi:10.1109/TSE.1983.236462
Usage of this product signifies your acceptance of the Terms of Use.