Estimating structural complexity of programs

MaRDI QIDQ1091117zbMATH OpenFDO

Authors L. F. Drobushevich

Publication date 1987

Published in Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

cyclomatic execution pathmetricR-programsR-technology

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Review text

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.

Recommendations

• Application of complexity metrics in functional languages
• A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS
• scientific article; zbMATH DE number 5052319
• Designing program structures in artificial intelligence systems by taking their complexity into account
• scientific article; zbMATH DE number 838665

Cited in

(6)

• Designing program structures in artificial intelligence systems by taking their complexity into account
• A system on visualization of program executive path and extraction of path sets
• Application of complexity metrics in functional languages
• LONG-RANGE CORRELATIONS IN COMPUTER PROGRAMS
• scientific article; zbMATH DE number 5117088 (Why is no real title available?)
• Evaluation of a recursion aware complexity metric

This page was built for publication: Estimating structural complexity of programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1091117)