* Ada in Denmark: Birthday of Ada - Talk on cyclomatic complexity
@ 2013-12-10 9:43 Jacob Sparre Andersen
2013-12-11 11:32 ` Jacob Sparre Andersen
0 siblings, 1 reply; 3+ messages in thread
From: Jacob Sparre Andersen @ 2013-12-10 9:43 UTC (permalink / raw)
Tonight at 17:30 Ada in Denmark will meet at:
Responsum K/S
Farum Gydevej 87
3520 Farum
https://plus.google.com/u/0/events/c5i8f6pga7apck08ss0nuqdicjk
The meeting is also open to non-members. Please let me or Thomas Løcke
(+45 60 43 19 92) know if you intend to attend the meeting.
Thomas Pedersen (who is an intern at AdaHeads K/S at the moment) will
give a short talk based on McCabe's cyclomatic complexity paper
(http://www.literateprogramming.com/mccabe.pdf).
Greetings,
Jacob
--
»Undrar om den biologiska klockan också har sådan där
snoozefunktion om gör att man kan somna och bli väckt
igen senare?« -- den beiga
^ permalink raw reply [flat|nested] 3+ messages in thread* Re: Ada in Denmark: Birthday of Ada - Talk on cyclomatic complexity
2013-12-10 9:43 Ada in Denmark: Birthday of Ada - Talk on cyclomatic complexity Jacob Sparre Andersen
@ 2013-12-11 11:32 ` Jacob Sparre Andersen
2013-12-12 7:42 ` Ludovic Brenta
0 siblings, 1 reply; 3+ messages in thread
From: Jacob Sparre Andersen @ 2013-12-11 11:32 UTC (permalink / raw)
A short report from the Ada in Denmark meeting yesterday:
We started the evening with Thomas Pedersen's presentation of the
principles in McCabe's cyclomatic complexity measure. Following up on
the presentation we discussed the experimental evidence available to
identify which (cyclomatic) complexities are acceptable. Per Dalgas was
kind enough to provide a "problematic" legacy subprogram in Ada which we
found to have a cyclomatic complexity of 9. McCabe himself indicates 10
as an upper limit and references some provided examples of problematic
subprograms with complexities of 16 and above (IIRC). I have done a
search for Ada subprograms with complexity above 10 in my published Ada
projects. All the examples I have found so far were straight
transcriptions from old FORTRAN sources.
The discussion continued on the subject of measuring source text
quality. Per Dalgas posed the challenge of how we get more software
developers to _use_ the available metrics. One option which came up was
to run quality metrics automatically on the source texts on public
version control repository services (such as Bitbucket, Github and
Sourceforge). This has the benefit of being something which initially
can be implemented as an independent service and only later be pushed to
the actual source hosting services (if they want it). But would
implementing such a measure make a difference? Will the developers
worry about it? Will the users of software use it as a selection
criteria if they get the possibility?
Then SQALE came up as an example of a "combined" source text quality
measure (I had the pleasure of attending Jean-Pierre Rosen's talk on
SQALE at Ada Europe 2011), but it appears that only few tools exist (and
none of them Open Source) and it wasn't obvious which languages the
tools can analyse.
In another branch of the discussion we wondered if we could get big
buyers/tenderers of software to require SQALE measures with constraints
on what is acceptable levels as a part of software delivery contracts.
Greetings,
Jacob
--
"Very small. Go to sleep" - monster (not drooling)
^ permalink raw reply [flat|nested] 3+ messages in thread
end of thread, other threads:[~2013-12-12 7:42 UTC | newest]
Thread overview: 3+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2013-12-10 9:43 Ada in Denmark: Birthday of Ada - Talk on cyclomatic complexity Jacob Sparre Andersen
2013-12-11 11:32 ` Jacob Sparre Andersen
2013-12-12 7:42 ` Ludovic Brenta
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox