Evaluation of a recursion aware complexity metric

MaRDI QIDQ6654411zbMATH OpenFDO

Authors István Bozó, Z. Budimac, Smiljana Knežev, Gordana Rakić, Melinda Tóth

Publication date 18 December 2024

Published in Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Computatorica (Search for Journal in Brave)

zbMATH Keywords

cyclomatic complexityoverall path complexityrecursionsoftware complexity

Mathematics Subject Classification ID

Theory of software (68N99)

Recommendations

• Application of complexity metrics in functional languages
• Estimating structural complexity of programs
• Why code complexity metrics fail on the C++ standard template library
• Metrics for maintainability of class inheritance hierarchies
• A semantic entropy metric

This page was built for publication: Evaluation of a recursion aware complexity metric

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