2012•Unpublished venueRequires access

Software testing method researching of Cyclomatic complexity

Lizhi Cai

Abstract

Cyclomatic complexity is a benchmark of code complexity. In software testing,cyclomatic complexity can be used to measure the complexity of a decision structure. The quantity of decision structure can be described as the number of independent path, which also means the minimum path number to test to prevent error. Cyclomatic complexity calculation plays a significant role in generating test cases for software business flow. Cyclomatic complexity calculation is convenient to measure the software quality. The paper indicates that cyclomatic complexity is greatly related to the number of bugs in software, also discusses the application of cyclomatic complexity in a practical project.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Cyclomatic complexity, Computer science, Programming complexity, Benchmark (surveying), Software quality, Measure (data warehouse), Software, Path (computing)