scientific article; zbMATH DE number 838665
From MaRDI portal
Publication:4863883
zbMATH Open0838.90075MaRDI QIDQ4863883FDOQ4863883
Authors: Chi-Ming Chung, Timothy K. Shih, Ying-Hong Wang, Ying-Feng Kou, Weichuan Lin
Publication date: 30 May 1996
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 1445809
- scientific article; zbMATH DE number 51799
- Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms.
- A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS
- scientific article; zbMATH DE number 2075906
software engineeringsoftware metriccontrol flow analysispath complexityquality and reliability of software
Cited In (11)
- Estimating structural complexity of programs
- Title not available (Why is that?)
- Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms.
- Metrics based optimization of functional source code
- Application of complexity metrics in functional languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applying Mccabe's complexity measure to multiple-exit programs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4863883)