Transcript PowerPoint-esitys

States and
Transformations
for
Software Engineering Theory
Hannu-Matti Järvinen and Mikko Tiusanen,
TUT/Software Systems
Engineering theory
• Any theory limits the domain of discourse.
• Concisely formulated(?).
• Understandable.
• Need not be ”final”.
• Applicable at various ”resolutions”: refinable!
• Predicts properties of artefacts!
Hannu-Matti Järvinen and Mikko Tiusanen
TUT/Software Systems
18.7.2015
2
SE artefacts
•
•
•
•
Computations: transformations of state.
Descriptions of computations (= programs).
Descriptions of programs.
Transformations of programs: SE processes.
 Computations or descriptions of such;
processes that transform a state; apply
recursively.
Hannu-Matti Järvinen and Mikko Tiusanen
TUT/Software Systems
18.7.2015
3
States and tranformations
• Can describe SE artefacts.
• Already have lots of theory, in various guises.
• What are the ”bulk” properties of interest in
the artefacts?
• What are the ”fields and potentials” that affect
the computations (trajectories)?
Hannu-Matti Järvinen and Mikko Tiusanen
TUT/Software Systems
18.7.2015
4
Language
Mathematics and logic:
”A poor thing but mine own.” (E.G. O’Neill)
UNITY, DisCo, TLA, Petri Nets, …
Refinement! Prediction of properties?
Hannu-Matti Järvinen and Mikko Tiusanen
TUT/Software Systems
18.7.2015
5