{'fraction_non_alphanumeric': 0.01636904761904762, 'fraction_numerical': 0.001488095238095238, 'mean_word_length': 4.65546218487395, '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}}
What can you Decide about Resetable Arrays

We investigate the decidability of reachability specifications in programs data-independent in two types X and Y , and which can contain arrays X 7→ Y . We show that this type of specification is undecidable in general for programs that may contain a Reset operation for setting all members of an array to a member of Y . However, if either X or Y is of fixed finite size (and not necessarily data independent) then we can obtain decidability results. The main results are obtained by simulating universal register machines by array programs, and by simulating array programs in the finiteY case by restricted register machines.