Abstract—Service composition is an important software development activity in the various phases of a service-oriented system. Developers would be keen to gauge the maintainability of the services they compose from the services available in a system. Complexity is widely acknowledged as a predictor of maintainability. McCabe’s cyclomatic complexity is accepted as a reliable metric for measuring complexity. This paper explains usefulness of a result from McCabe’s work in computing cyclomatic complexity of composite modules or components. It suggests improvements to an existing formal model of service-oriented system. It then applies the McCabe’s result to define recursively a cyclomatic complexity generalization for a composite service.
Index Terms—Composite service, cyclomatic complexity, metric, service-oriented architecture.
R. P. Singh is with I. K. G. Punjab Technical University and CSE, GIMET, Amritsar, India (e-mail: rupi.pal@gmail.com).
H. Singh is with Dept. of CS, Guru Nanak Dev University, Amritsar, India (e-mail: hardeep.dcse@gndu.ac.in).
[PDF]
Cite:Rupinder Pal Singh and Hardeep Singh, "A Cyclomatic Complexity Generalization for a Composite Service," International Journal of Computer Theory and Engineering vol. 13, no. 2, pp. 47-55, 2021.
Copyright © 2021 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
