A metric for evaluating residual complexity in software

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A new metric for evaluating the complexity of software is proposed: The residual complexity. This is the combination of a complexity metric with a code coverage metric. It indicates how well the complexity of a software is handled by software tests, and how much complexity still remains untested. In this paper we give an overview over existing source code metrics and code coverage metrics. Afterwards the residual complexity is described and the consequences are discussed. In the end a use case is shown on a real life example of a software application implemented in.NET.

Cite

CITATION STYLE

APA

Krisper, M., Iber, J., Kreiner, C., & Quaritsch, M. (2017). A metric for evaluating residual complexity in software. In Communications in Computer and Information Science (Vol. 748, pp. 138–149). Springer Verlag. https://doi.org/10.1007/978-3-319-64218-5_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free