Estimating structural complexity of programs (Q1091117)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Estimating structural complexity of programs |
scientific article; zbMATH DE number 4009798
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Estimating structural complexity of programs |
scientific article; zbMATH DE number 4009798 |
Statements
Estimating structural complexity of programs (English)
0 references
1987
0 references
The article focuses on estimation of structural complexity of programs. An algorithm to find the cyclomatic execution path of a program is described. This is the first time that such a metric is derived for programs developed by the R-technology. A comparative analysis of metrics for ordinary programs and R-programs is performed using an example.
0 references
cyclomatic execution path
0 references
metric
0 references
R-technology
0 references
R-programs
0 references
0.7202954292297363
0 references