Jianqiang Zhuo, P. Oman, Ramkumar V. Pichai, Sujay Sahni
{"title":"Using relative complexity to allocate resources in gray-box testing of object-oriented code","authors":"Jianqiang Zhuo, P. Oman, Ramkumar V. Pichai, Sujay Sahni","doi":"10.1109/METRIC.1997.637167","DOIUrl":"https://doi.org/10.1109/METRIC.1997.637167","url":null,"abstract":"Software testing costs would be reduced if managers and testing engineers could gauge which parts of a system were more complex and thus more likely to have faults. Once these areas are identified, testing resources and testing priority could be assigned accordingly. The paper defines a method that uses the relative complexity metric to allocate resources for gray box testing in an environment where object oriented code is used and historical data are not available. The proposed method can also be applied to black box and white box testing as well as software quality assessments such as maintainability and reliability. The work on an industrial C++ software subsystem presented here shows that the rank order of minor test areas of the subsystem by relative test complexity is significantly similar to the rank order obtained from the experts who designed, wrote and tested the code.","PeriodicalId":421008,"journal":{"name":"Proceedings Fourth International Software Metrics Symposium","volume":"44 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129193540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A methodology for risk assessment of functional specification of software systems using colored Petri nets","authors":"H. Ammar, T. Nikzadeh, J. Dugan","doi":"10.1109/METRIC.1997.637171","DOIUrl":"https://doi.org/10.1109/METRIC.1997.637171","url":null,"abstract":"The paper presents a methodology for risk assessment in complex real time software systems at the early stages of development, namely the analysis/design phase. A heuristic risk assessment technique is described based on colored Petri net (CPN) models. The technique uses complexity metrics and severity measures in developing a heuristic risk factor from software functional specifications. The objective of risk assessment is to classify the software components according to their relative importance in terms of such factors as severity and complexity. Both traditional static and dynamic complexity measures are supported. Concurrency complexity is presented as a new dynamic complexity metric. This metric measures the added dynamic complexity due to concurrency in the system. Severity analysis is conducted using failure mode and effect analysis (FMEA). The methodology presented here is applied to a large scale software system as presented in a companion paper (H. Ammar et al., 1997).","PeriodicalId":421008,"journal":{"name":"Proceedings Fourth International Software Metrics Symposium","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117016708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Some misconceptions about lines of code","authors":"J. Rosenberg","doi":"10.1109/METRIC.1997.637174","DOIUrl":"https://doi.org/10.1109/METRIC.1997.637174","url":null,"abstract":"Source lines of code (SLOC) is perhaps the oldest of software metrics, and still a benchmark for evaluating new ones. Despite the extensive experience with the SLOC metric, there are still a number of misconceptions about it. The paper addresses three of them: (1) that the format of SLOC is relevant to how to properly count it (a simple experiment shows that, in fact, it does not matter), (2) that SLOC is most useful as a predictor of software quality (in fact it is most useful as a covariate of other predictors), and (3) that there is an important inverse relationship between defect density and code size (in fact, this is an arithmetic artifact of plotting bugs-per-SLOC against SLOC).","PeriodicalId":421008,"journal":{"name":"Proceedings Fourth International Software Metrics Symposium","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114609716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An empirical analysis of equivalence partitioning, boundary value analysis and random testing","authors":"S. Reid","doi":"10.1109/METRIC.1997.637166","DOIUrl":"https://doi.org/10.1109/METRIC.1997.637166","url":null,"abstract":"An experiment comparing the effectiveness of equivalence partitioning (EP), boundary value analysis (BVA) and random testing was performed, based on an operational avionics system of approximately 20000 lines of Ada code. The paper introduces an experimental methodology that considers all possible input values that satisfy a test technique and all possible input values that would cause a module to fail (rather than arbitrarily chosen values from these sets) to determine absolute values for the effectiveness for each test technique. As expected, an implementation of BVA was found to be most effective, with neither EP nor random testing half as effective. The random testing results were surprising, requiring just 8 test cases per module to equal the effectiveness of EP, although somewhere in the region of 50000 random test cases were required to equal the effectiveness of BVA.","PeriodicalId":421008,"journal":{"name":"Proceedings Fourth International Software Metrics Symposium","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114640439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Metrics for database systems: an empirical study","authors":"Stephen G. MacDonell","doi":"10.1109/METRIC.1997.637170","DOIUrl":"https://doi.org/10.1109/METRIC.1997.637170","url":null,"abstract":"An important task for any software project manager is to be able to predict and control project size and development effort. Unfortunately, there is comparatively little work, other than function points, that tackles the problem of building prediction systems for software that is dominated by data considerations, in particular systems developed using 4GLs. We describe an empirical investigation of 70 such systems. Various easily obtainable counts were extracted from data models (e.g. number of entities) and from specifications (e.g. number of screens). Using simple regression analysis, a prediction system of implementation size with accuracy of MMRE=21% was constructed. This approach offers several advantages. First there tend to be fewer counting problems than with function points since the metrics we used were based upon simple counts. Second, the prediction systems were calibrated to specific local environments rather than being based upon industry weights. We believe this enhanced their accuracy. Our work shows that it is possible to develop simple and useful local prediction systems based upon metrics easily derived from functional specifications and data models, without recourse to overly complex metrics or analysis techniques. We conclude that this type of use of metrics can provide valuable support for the management and control of 4GL and database projects.","PeriodicalId":421008,"journal":{"name":"Proceedings Fourth International Software Metrics Symposium","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131933805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Inheritance tree shapes and reuse","authors":"Byung-Kyoo Kang, J. Bieman","doi":"10.1109/METRIC.1997.637163","DOIUrl":"https://doi.org/10.1109/METRIC.1997.637163","url":null,"abstract":"The shapes of forests of inheritance trees can affect the amount of code reuse in an object-oriented system. Designers can benefit from knowing how structuring decisions affect reuse, so that they can make more optimal decisions. We show that a set of objective measures can classify forests of inheritance trees into a set of five shape classes. These shape classes determine bounds on reuse measures based on the notion of code savings. The reuse measures impart an ordering on the shape classes that demonstrates that some shapes have more capacity to support reuse through inheritance. An initial empirical study shows that the application of the measures and demonstrates that real inheritance forests can be objectively and automatically classified into one of the five shape classes.","PeriodicalId":421008,"journal":{"name":"Proceedings Fourth International Software Metrics Symposium","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132015822","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}