{"title":"测量软件的图抽象:一种信息论方法","authors":"E. B. Allen","doi":"10.1109/METRIC.2002.1011337","DOIUrl":null,"url":null,"abstract":"A graph composed of nodes and edges may be an abstraction of a software system and a subgraph may represent a software module. Software-design graphs depict components and their relationships. Building on prior work by E.B. Allen, T.M. Khoshgoftaar and Y. Chen (2001), this paper proposes information theory-based measures on graphs at the system and module levels for application to software. We propose measures of size, length, complexity, coupling and cohesion which largely conform to the properties of these attributes defined by L.C. Briand, S. Morasca and V.R. Basili (1996, 1997). We illustrate the measures with examples and suggest extensions for hypergraphs.","PeriodicalId":165815,"journal":{"name":"Proceedings Eighth IEEE Symposium on Software Metrics","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"42","resultStr":"{\"title\":\"Measuring graph abstractions of software: an information-theory approach\",\"authors\":\"E. B. Allen\",\"doi\":\"10.1109/METRIC.2002.1011337\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A graph composed of nodes and edges may be an abstraction of a software system and a subgraph may represent a software module. Software-design graphs depict components and their relationships. Building on prior work by E.B. Allen, T.M. Khoshgoftaar and Y. Chen (2001), this paper proposes information theory-based measures on graphs at the system and module levels for application to software. We propose measures of size, length, complexity, coupling and cohesion which largely conform to the properties of these attributes defined by L.C. Briand, S. Morasca and V.R. Basili (1996, 1997). We illustrate the measures with examples and suggest extensions for hypergraphs.\",\"PeriodicalId\":165815,\"journal\":{\"name\":\"Proceedings Eighth IEEE Symposium on Software Metrics\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"42\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Eighth IEEE Symposium on Software Metrics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/METRIC.2002.1011337\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Eighth IEEE Symposium on Software Metrics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/METRIC.2002.1011337","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Measuring graph abstractions of software: an information-theory approach
A graph composed of nodes and edges may be an abstraction of a software system and a subgraph may represent a software module. Software-design graphs depict components and their relationships. Building on prior work by E.B. Allen, T.M. Khoshgoftaar and Y. Chen (2001), this paper proposes information theory-based measures on graphs at the system and module levels for application to software. We propose measures of size, length, complexity, coupling and cohesion which largely conform to the properties of these attributes defined by L.C. Briand, S. Morasca and V.R. Basili (1996, 1997). We illustrate the measures with examples and suggest extensions for hypergraphs.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
