I used this set of slides for a talk I gave at the SCRUM Breakfast in Bern on June 30, 2010.

1. agile steps
to improve
the status quo
www.tudorgirba.com

2. www.tudorgirba.com

3. 2002
www.tudorgirba.com

4. PhD
2002 2005
www.tudorgirba.com

5. PhD PostDoc
2002 2005 2009
www.tudorgirba.com

6. PhD PostDoc
2002 2005 2009
Consultant
www.tudorgirba.com

8. agile steps
to improve
the status quo
www.tudorgirba.com

9. agile steps challenge
to improve demo
the status quo listen
enable
www.tudorgirba.com

10. the status quo

11. the status quo
the existing state of affairs

12. Picture by _FXR

15. Picture by _FXR
F = m .a

18. E = m. c 2

21. pos t-it

23. the status quo
the existing state of affairs

24. the status quo
the sum of our assumptions

25. It’s not what you don’t know that kills you,
it’s what you know that isn’t so
o
Tom de Marc

26. challenge

27. challenge
present

28. presenting is storytelling

29. story = fairy tale

30. design
your story

31. message
message
message
message
message
message
message
message
message message
message
message
essage
message
message message message
message
message message message
message
message
message message message message
message message
message
message
message
message message
message message
message

32. message
message
message
message
message
message
message
message
message message
message
message
essage
message
message message message
message
message message message
message
message
message message message message
message message
message
message
message
message message
message message
message

33. one message

37. Modeling History
to Understand Software Evolution
Inauguraldissertation der
Philosophisch-naturwissenschaftlichen
Fakultät der Universität Bern
vorgelegt von
Tudor Gîrba
von Rumänien
Leiter der Arbeit:
Prof. Dr. Stéphane Ducasse
Prof. Dr. Oscar Nierstrasz
Institut für Informatik und
angewandte Mathematik

38. To provide a generic
meta-model for
expressing software
evolution analyses,
Modeling History we need to recognize
to Understand Software Evolution evolution as an explicit
phenomenon and model
Inauguraldissertation der
Philosophisch-naturwissenschaftlichen
Fakultät der Universität Bern
it as a first class entity.
vorgelegt von
Tudor Gîrba
von Rumänien
Leiter der Arbeit:
Prof. Dr. Stéphane Ducasse
Prof. Dr. Oscar Nierstrasz
Institut für Informatik und
angewandte Mathematik

39. one message

40. deliver one message

41. slides

42. slides are visual aids

43. slides are visual aids

44. Important sign
1. At this sign, stop, look around and proceed if no other car is
coming your way.
2. Important!!!! The cars coming from the other directions will
not have to stop.
3. This sign was put here by the authorities in charge.
4. This sign concerns vehicles only. Pedestrians should look at
the signs dedicated to them.
5. This sign should not be touched or hindered in any way. Any
violation is punishable according to the law.

45. STOP

46. Important sign
• At this sign, stop, look around and proceed if no other car is
STOP
coming your way.
• Important!!!! The cars coming from the other directions will not
have to stop.
• This sign was put here by the authorities in charge.
• This sign concerns vehicles only. Pedestrians should look at
the signs dedicated to them.
• This sign should not be touched or hindered in any way. Any
violation is punishable according to the law.

47. tailed effective
de
Important sign
• At this sign, stop, look around and proceed if no other car is
STOP
coming your way.
• Important!!!! The cars coming from the other directions will not
have to stop.
• This sign was put here by the authorities in charge.
• This sign concerns vehicles only. Pedestrians should look at
the signs dedicated to them.
• This sign should not be touched or hindered in any way. Any
violation is punishable according to the law.

50. projector = screen

55. in bet ween
th e sto r y is

56. slides are visual aids

57. slides are visual aids

61. en.com rte.com
pre se ntationz blog.du
a
kin.com
fthenap
t hebacko
tudorgirba.com/blog

62. www.ted.com

63. presenting is storytelling

64. challenge
present

65. challenge
present
demo

68. content

69. content form

70. content form

71. content form

72. yesterday’s
weather

74. 30%

75. 30% 90%

76. yesterdayWeatherProbabilityWithTopPreviousWENM: topPreviousWENM
andTopCurrentENM: topCurrentENM
| currentVersions previousClassHistoriesSortedByWENM
yesterdayWeatherHits last2VersionsTopHistories last2Versions
last2HistoriesSortedByENM x valuesCount previousVersionsTopHistories
previousVersionsTopHistoriesNames over |
currentVersions := OrderedCollection new.
currentVersions addLast: (self allVersionNames at: 1).
yesterdayWeatherHits := 0.
(2 to: self allVersionNames size) do: [: i |
self smelly: 'this algorithm is too big and complex'.
previousClassHistoriesSortedByWENM := (self classHistories
selectFromReferenceVersionCollection: currentVersions)
sortBy: [:a :b | a value getWENM >= b value getWENM].
currentVersions addLast: (self allVersionNames at: i).
previousVersionsTopHistories := OrderedCollection new.
x := previousClassHistoriesSortedByWENM first value getWENM.
valuesCount := 0.
previousClassHistoriesSortedByWENM do: [ :each |
(each value getWENM ~= x) ifTrue: [
valuesCount := valuesCount + 1. x:= each value getWENM].
(valuesCount < topPreviousWENM) ifTrue: [
previousVersionsTopHistories addLast: each]
].
last2VersionsTopHistories := OrderedCollection new.
last2Versions := OrderedCollection new.
last2Versions addLast: (self allVersionNames at: (i-1)).
last2Versions addLast: (self allVersionNames at: i).

77. valuesCount := valuesCount + 1. x:= each value getWENM].
(valuesCount < topPreviousWENM) ifTrue: [
previousVersionsTopHistories addLast: each]
].
last2VersionsTopHistories := OrderedCollection new.
last2Versions := OrderedCollection new.
last2Versions addLast: (self allVersionNames at: (i-1)).
last2Versions addLast: (self allVersionNames at: i).
last2HistoriesSortedByENM := (self classHistories
selectFromReferenceVersionCollection: last2Versions)
sortBy: [:a :b | a value getWENM >= b value getWENM].
x := last2HistoriesSortedByENM first value getENM.
valuesCount := 0.
last2HistoriesSortedByENM do: [ :each |
(each value getENM ~= x) ifTrue: [
valuesCount := valuesCount + 1. x:= each value getENM].
(valuesCount < topCurrentENM) ifTrue: [
last2VersionsTopHistories addLast: each]
].
previousVersionsTopHistoriesNames := previousVersionsTopHistories
collect: [ :each | each value name].
over := false.
last2VersionsTopHistories do: [:each |
((previousVersionsTopHistoriesNames includes: (each value name))
and: [over not]) ifTrue: [
yesterdayWeatherHits := yesterdayWeatherHits + 1. over := true].
].
].
^yesterdayWeatherHits/(self size - 1) asFloat.

78. yesterdayWeatherProbabilityWithTopPreviousWENM: topPreviousWENM
andTopCurrentENM: topCurrentENM
| currentVersions previousClassHistoriesSortedByWENM
yesterdayWeatherHits last2VersionsTopHistories last2Versions
last2HistoriesSortedByENM x valuesCount previousVersionsTopHistories
previousVersionsTopHistoriesNames over |
currentVersions := OrderedCollection new.
currentVersions addLast: (self allVersionNames at: 1).
yesterdayWeatherHits := 0.
(2 to: self allVersionNames size) do: [: i |
self smelly: 'this algorithm is too big and complex'.
previousClassHistoriesSortedByWENM := (self classHistories
selectFromReferenceVersionCollection: currentVersions)
sortBy: [:a :b | a value getWENM >= b value getWENM].
currentVersions addLast: (self allVersionNames at: i).
previousVersionsTopHistories := OrderedCollection new.
x := previousClassHistoriesSortedByWENM first value getWENM.
valuesCount := 0.
previousClassHistoriesSortedByWENM do: [ :each |
(each value getWENM ~= x) ifTrue: [
valuesCount := valuesCount + 1. x:= each value getWENM].
(valuesCount < topPreviousWENM) ifTrue: [
previousVersionsTopHistories addLast: each]
].
last2VersionsTopHistories := OrderedCollection new.
last2Versions := OrderedCollection new.
last2Versions addLast: (self allVersionNames at: (i-1)).
last2Versions addLast: (self allVersionNames at: i).

79. yesterdayWeatherProbabilityWithTopPreviousWENM: topPreviousWENM
andTopCurrentENM: topCurrentENM
| currentVersions previousClassHistoriesSortedByWENM
yesterdayWeatherHits last2VersionsTopHistories last2Versions
last2HistoriesSortedByENM x valuesCount previousVersionsTopHistories
previousVersionsTopHistoriesNames over |
currentVersions := OrderedCollection new.
currentVersions addLast: (self allVersionNames at: 1).
yesterdayWeatherHits := 0.
(2 to: self allVersionNames size) do: [: i |
self smelly: 'this algorithm is too big and complex'.
previousClassHistoriesSortedByWENM := (self classHistories
selectFromReferenceVersionCollection: currentVersions)
sortBy: [:a :b | a value getWENM >= b value getWENM].
currentVersions addLast: (self allVersionNames at: i).
previousVersionsTopHistories := OrderedCollection new.
x := previousClassHistoriesSortedByWENM first value getWENM.
valuesCount := 0.
previousClassHistoriesSortedByWENM do: [ :each |
(each value getWENM ~= x) ifTrue: [
valuesCount := valuesCount + 1. x:= each value getWENM].
(valuesCount < topPreviousWENM) ifTrue: [
previousVersionsTopHistories addLast: each]
].
last2VersionsTopHistories := OrderedCollection new.
last2Versions := OrderedCollection new.
last2Versions addLast: (self allVersionNames at: (i-1)).
last2Versions addLast: (self allVersionNames at: i).

82. present

83. past
present

84. past future
present

85. past future
present

86. past future
present

87. past future
prediction hit present

88. past future
YesterdayWeatherHit(present):
past:=all.topChanged(beginning, present)
future:=all.topChanged(present, end)
past.intersect(future).notEmpty()
prediction hit present

89. hit hit hit
YW = 3 / 8 = 37%
hit hit hit hit hit hit hit
YW = 7 / 8 = 87%

90. yWFor: yesterdayCheck for: tomorrowCheck
^ ( 3 to: self versions size ) collect: [ :i |
| yesterday tomorrow |
yesterday := self
selectByExpression: yesterdayCheck
appliedFromVersionIndex: 1
toVersionIndexAndPresentInIt: i - 1.
tomorrow := self
selectByExpression: tomorrowCheck
appliedFromVersionIndexAndPresentInIt: i - 1
toVersionIndex: self versions size.
yesterday intersectWith: tomorrow ]
yWFor: yesterdayCheck for: tomorrowCheck
| hits |
hits := (self detailedYWFor: yesterdayCheck for: tomorrowCheck)
sum: [ :each | each isEmpty ifTrue: [0] ifFalse: [1]].
^ hits / (self versions size - 2)

91. content form

94. content form

95. challenge
demo

96. challenge
demo
listen

97. challenge
demo
listen
enable

99. It’s not Lupus

101. logy
ed techno
establish

102. logy
ed techno
establish

103. logy
ed techno
establish

104. hn ive
gy
tec rupt
olo
dis
logy
ed techno
establish

106. 1 2 3 4
5 6 7 8
9 10 15 11
13 14 12

107. 1 2 3 4
5 6 7 8
9 10 15 11
13 14 12

108. 1 2 3 4
5 6 7 8
9 10 11
13 14 15 12

109. 1 2 3 4
5 6 7 8
9 10 11
13 14 15 12

110. 1 2 3 4
5 6 7 8
9 10 11 12
13 14 15

111. 1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16

112. 1 2 3 4
5 6 7 8
9 10 11 12

113. What
Where
When
Who
How

114. What
Why
Where
When
Who
How

115. challenge
demo
listen
enable

116. agile steps challenge
to improve demo
the status quo listen
enable
www.tudorgirba.com