In the past we viewed software traces and logs as temporarily ordered event sequences. Since events are just memory data we have a map:
T -> M
This can be seen in the definition of a software trace (Volume 3, page 308). Here we generalize the domain to any arbitrary set, for example, it can be a list of indexes or pointers or even memory itself. The latter map can give us narrative chains such as:
M -> M -> M -> M
And even give us a grand unification of memory and log analysis and the possibility to apply software narratology to memory dump analysis as well.