The cross cyclomatic complexity: a bi-dimensional measure for program complexity on graphs release_bewce772o5bspkfpkp5zslks7m

by Hugo Tremblay, Fabio Petrillo

Released as a article .

2020  

Abstract

Reduce and control complexity is an essential practice in software design. Cyclomatic complexity (CC) is one of the most popular software metrics, applied for more than 40 years. Despite CC is an interesting metric to highlight the number of branches in a program, it clearly not sufficient to represent the complexity in a piece of software. In this paper, we introduce the cross cyclomatic complexity (CCC), a new bi-dimensional complexity measure on graphs that combines the cyclomatic complexity and the weight of a minimum-weight cycle basis in as pair on the Cartesian plan to characterize program complexity using control flow graphs. Our postulates open a new venue to represent program complexity, and we discuss its implications and opportunities.
In text/plain format

Archived Files and Locations

application/pdf  352.4 kB
file_pkxheokalbh4hpd3ebjidwfaxa
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2020-03-01
Version   v1
Language   en ?
arXiv  2003.00399v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 09d4fa5d-bda4-4095-9084-74677cf76c31
API URL: JSON