Development model for assessing the structural complexity of programs
Alla S. Rvanova - Associate Professor, Candidate of Pedagogical Sciences, Research and Educational Center for Mathematics, ITMO University,
Natalya S. Kolyeva - Associate Professor, Candidate of Pedagogical Sciences, Associate Professor of the Department of Information Technologies and Statistics. Ural State University of Economics,
Marina V. Panova - Senior Lecturer of the Department of Information Technologies and Statistics. Ural State University of Economics
Abstract
The research is devoted to the estimation the structural complexity of programs. The algorithm of finding cyclomatic routes for program executions is described. By now, two directions of obtaining estimates for the complexity estimates in software modules have been defined: structural and statistical. Both directions connect the value of program complexity with the labor intensity related to their development. The structural complexity of program modules is determined by the number of interacting components, the number and complexity of links between them. The complexity of a program's behavior depends to a large extent on the set of routes through which it is executed. The complexity metric obtained from these positions allows us to determine estimates of the cost of designing the program as a whole, as well as to identify the modules that are likely to contain the most errors, especially the logical ones.
Keywords: algorithm complexity; metrics; analysis; estimation; graph; graph vertices; modeling.
For citation: Rvanova A.S., Kolyeva N.S., Panova M.V. Development model for assessing the structural complexity of programs. Digital models and solutions. 2024. Vol. 3, no. 2. Pp. 5–16. DOI: 10.29141/2949-477X-2024-3-2-1. EDN: UEZYBI.
