{'fraction_non_alphanumeric': 0.006726457399103139, 'fraction_numerical': 0.0, 'mean_word_length': 5.385714285714286, '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}}
Computing the Reduced Product of Program Analyses

A reduction relation between abstract domains is introduced to identify situations where computation of the reduced products of program analyses can be made more eecient. A method for eeciently computing the reduced products of program analyses in these situation is presented. The method is illustrated by computing the reduced product of groundness and pair sharing analyses of logic programs.