Software Measures - Software Engineering: Dependability

More documents

Recommendations

Info

QMSS - <strong>Software</strong> Measurement© Prof. Dr. LiggesmeyerCyclomatic Complexity• Common measure of complexity• Often surrounded with an aura of an ‘important’ key measure• Originated from graph theory (strongly connected graphs) and thus relating tocontrol flow graphs and programs• Calculation: e – n + 2(e = Number of edges, n = Number of nodes)• Easy to calculate as it depends strongly on the number of decisions within theprogram• Suited as complexity measure, if the number of decisions predicate thecomplexity of the program• Probably the most common measure in analysis and testing tools20
QMSS - <strong>Software</strong> Measurement© Prof. Dr. LiggesmeyerCyclomatic Complexity• Cyclomatic number is a measure of the structural complexity of programs• Calculation based on the control flow graph• Cyclomatic number v(G) of a graph is: v(G) = e - n + 2(e – Number of edges, n – Number of nodes)21
Page 1 and 2: Quality Management of Software and
Page 3 and 4: MotivationMeasurementQMSS - Softwar
Page 5 and 6: Motivation: Measuring Quality in So
Page 7 and 8: Software Quality Experiments: Stoch
Page 9 and 10: QMSS - Software Measurement© Prof.
Page 11 and 12: Software MeasuresApplying MeasuresQ
Page 13 and 14: Software Measures : Requirements of
Page 15 and 16: Software MeasuresEvaluation of Meas
Page 17 and 18: Measurement Scales• While express
Page 19: Measurement Scales• Rational scal
Page 23 and 24: Current Impact of Software Measurem
Page 25 and 26: Current Impact of Software Measurem
Page 27 and 28: QMSS - Software Measurement© Prof.
Page 29 and 30: Software Quality Measurement: Popul
Page 35: QMSS - Software Measurement© Prof.

Software Measures - Software Engineering: Dependability

Create successful ePaper yourself

Delete template?

Save as template?