Pages that link to "Item:Q3719804"
From MaRDI portal
The following pages link to A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS (Q3719804):
Displaying 8 items.
- The structured complexity of object-oriented programs (Q596971) (← links)
- Reading beside the lines: Using indentation to rank revisions by complexity (Q1021465) (← links)
- Estimating structural complexity of programs (Q1091117) (← links)
- Measuring prime program complexity (Q1328506) (← links)
- Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms. (Q1413809) (← links)
- Correction of the software science length estimator skewness for `C' language programs (Q1856227) (← links)
- Applying Mccabe's complexity measure to multiple-exit programs (Q3334078) (← links)
- Information-theoretic Complexity of Program Specifications (Q3761671) (← links)