Abstract
Much work has been published in recent years relating to the field of hierarchical software metrics. These are the structural measures, defined recursively over the program or flowgraph decomposition into sequences of prime flowgraphs, nested level-by-level. The theory of hierarchical metrics is generalised and extended well beyond its original framework, introducing a notion of convexity that permits combinations of (generalised) hierarchical metrics to be studied, so that weights can be given to various software attributes of interest to the individual investigator. It is found that certain concepts, for example those of independence and rank, that have their roots in linear algebra are applicable here. Examples are described that show the range of application of these fundamental notions.
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.
