Elements of Software Science (Operating and programming systems series)
Elements of Software Science (Operating and programming systems series)
Data flow analysis techniques for test data selection
ICSE '82 Proceedings of the 6th international conference on Software engineering
On the relationships among three software metrics
Proceedings of the 1981 ACM workshop/symposium on Measurement and evaluation of software quality
On data flow guided program testing
ACM SIGPLAN Notices
Evaluating Software Complexity Measures
IEEE Transactions on Software Engineering
What to do beyond branch testing
ACM SIGSOFT Software Engineering Notes
Program obfuscation: a quantitative approach
Proceedings of the 2007 ACM workshop on Quality of protection
Data Flow Analysis of UML Action Semantics for Executable Models
ECMDA-FA '08 Proceedings of the 4th European conference on Model Driven Architecture: Foundations and Applications
Information and Software Technology
| Hi-index | 0.00 |
This paper presents a new approach to measuring program complexity with the use of data flow information in programs. A complexity metric, called DU, is defined for the control graph of a structured program. This new metric is different from other control-graph based metrics in that it is based on “representative” data flow information in a control graph. An algorithm for computing the value of DU(G) for a control graph G is given. The lower and upper bounds of DU(G) are provided. The DU metric is shown to have several advantages over other control-graph based complexity metrics.