{'fraction_non_alphanumeric': 0.02081165452653486, 'fraction_numerical': 0.0, 'mean_word_length': 5.54421768707483, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Algebraic Models of Temporal Abstraction for Initialised Iterated State Systems: An Abstract Pipelined Case Study

The data and temporal abstractions of a pipelined case study are explored in an algebraic setting. We apply a set of algebraic tools for modelling microprocessors to the specification, pipelined implementation, and formal verification of an abstract case study. We employ a model of time based on counting events by means of a clock. We model systems as iterated maps that evolve over time from some initial state. We define formal correctness conditions, and introduce the one-step theorems that, given certain conditions, reduce the complexity of formal verification. The algebraic models provide: (i) modular descriptions of pipelined systems, including correctness criteria; and (ii) equational specification and verification techniques for the design of pipelined systems applicable to a range of specification languages and theorem provers.