{'fraction_non_alphanumeric': 0.011185682326621925, 'fraction_numerical': 0.0, 'mean_word_length': 5.492753623188406, '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}}
Correctness and equivalence of straight line microprograms

This paper is concerned with developing automatic methods for the testing of correctness and equivalence of straight line segments of microcode. A model, which accounts for a composite of features common to a large variety of contemporary machines is first presented. Correctness and equivalence of straight line microprograms are then defined. The testing techniques are then developed.