{'fraction_non_alphanumeric': 0.015414258188824663, 'fraction_numerical': 0.0019267822736030828, 'mean_word_length': 5.117647058823529, '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}}
Accessibility rules OK!

This paper shows that the intuitive notion of accessibility is correctly met by the rules of Ada 9X. In particular, it shows that despite the notion of accessibility being intrinsically dynamic, nevertheless the rules can in the majority of situations be checked statically without any loss of capability. It also explores the impact of access parameters and shows that the mechanism suggested in the Annotated Reference Manual [AARM] does indeed exactly map onto the requirements of the rules.