Abstract
In the design of software metrics, increasing attention has been given to the complexity arising from the pattern of coupling among subprograms. We call it the “subprogram problem” — to discover the most effective means whereby one might judiciously assign a measure to the subprogram calls appearing in the context of tightly-coupled modules. We phrase our solution in the language of matrix analysis, giving rise to both an exact and an iterative computational approach. The resulting methodology is uniform over a wide range of software metrics, integrating an accounting for the coupling complexity into the extended meaning of a particular metric. A running example is provided, fully illustrating the technique.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
