Technical accomplishments:  Work this month focused on the dynamic
semantics of Stateflow. It was found that, while vanilla Abstract State
Machines provide a precise language with which to define and reason about
the dynamic semantics, accommodating the recursive nature of Stateflow
meant including an explicit stack in the model.  Including explicit
stack manipulation operations in the semantics was found to obfuscate the
semantics. For this reason we have extended the modelling language with
simple procedures. Programs in this extended language can be translated
into vanilla ASMs or into monadic style functional programs.

Both of these translations are under consideration as they render the
Stateflow semantics executable. Having an executable semantics is important
both for demonstrations and for validating the semantics with respect to
the MathWorks tool.

Meetings: We have begun a dialogue with Audra Lapati and Jim Tung at
MathWorks with the aim of collaborating with MathWorks in defining the
semantics of Stateflow. MathWorks have expressed considerable interest
in the MoBIES project and Kestrel's work in particular. MathWorks
staff have tentatively agreed to provide Kestrel with a `seat'
(license) for their tool suite. They have to gather internal approvals
for this grant, so we anticipate that it will not be done as quickly
as we would hope.