On History-Sensitive Models of Interactive Stacks

We model the behaviour of an interactive stack in the setting of history functions on different levels of abstraction. The component's internal state is systematically introduced as an abstraction of the input history. We explore different history abstractions and describe the corresponding history-sensitive models by state transition machines with input and output. The case study exemplifies a formal method how to derive history-sensitive implementations of interactive data structures in a correctness-preserving way