{'fraction_non_alphanumeric': 0.01756756756756757, 'fraction_numerical': 0.0, 'mean_word_length': 5.675675675675675, '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}}
Predicting Runtime Data Dependences for Slice Inspection Prioritization

Data dependences are building blocks for techniques such as program slicing and, thus, are useful for program comprehension and debugging. Unfortunately, static analysis identifies many data dependences that are infeasible or unlikely to occur at runtime. Dynamic analysis, in contrast, does not identify all data dependences that can occur in a program. To address this inaccuracy, we present a new static analysis that predicts the likelihood of occurrence of data dependences to help engineers prioritize their inspection of those dependences. Our preliminary results indicate that our analysis, while having room for improvement, has a promising predictive power.