METRICS OF DIFFERENTIATED CYCLOMATIC COMPLEXITY OF SOFTWARE CODE ANALYSIS USING DATABASE MANAGEMENT SYSTEMS

Abstract

In the modern world, the level of software development has reached a sufficiently high standard, making the question of quality software development particularly relevant. Specifically, the issue of analyzing the code of a software application allows for a thorough examination of every line of source code to understand its characteristics, quality, and potential issues. The quality and reliability of a program, as well as its future success, depend on the analysis of the source code.

This is especially true for today's popular software with a multi-tiered structure, where various algorithmic elements, such as databases, are distributed among different applications, requiring special attention to data exchange implementation.

This article explores modern solutions in the field of code analysis, highlighting their advantages and disadvantages. Existing code complexity metrics are examined for possible combinations to achieve better results, resulting in the proposal of a metric called "Differential Cyclomatic Complexity," which is based on the combination of cyclomatic complexity and Chapin's metric.