McCabe's Cyclomatic Complexity equation, the surprising implications for code reuse, and the road ahead for (all) computer languages.
Description changed:
Speaker: Philip Morant
When: 9th July, 7pm. Outhouse pub.
Title: McCabe's Cyclomatic Complexity equation, the surprising
implications for code reuse, and the road ahead for (all) computer
languages.
Abstract:
McCabe's Cyclomatic Complexity equation is introduced and the
necessary background in Control Flow Graphs presented. Consideration
of the equation shows that code reuse increases cyclomatic complexity.
'Critical Nodes' are defined and discussed. A refactoring technique
for reducing cyclomatic complexity without loss of reuse is shown.
Some common assumptions about code reuse are examined. Possibilities
for adapting computer languages are discussed.