{'fraction_non_alphanumeric': 0.03665521191294387, 'fraction_numerical': 0.003436426116838488, 'mean_word_length': 5.333333333333333, 'pattern_counts': {'":': 0, '<': 2, '<?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}}
Structural Information Analysis for CLP Languages

We present the rational construction of a generic domain for structural analysis of CLP languages: Pattern(D]), where the parameter D] is an abstract domain satisfying certain properties. Our domain builds on the parameterized domain for the analysis of Prolog programs Pat(<), which is due to Cortesi et al. [6, 7]. However, the formalization of our CLP abstract domain is independent from specific implementation techniques: Pat(<) (suitably extended) is one of the possible implementations. Reasoning at a higher level of abstraction we are able to appeal to familiar notions of unification theory. One advantage is that we can identify an important parameter (a common anti-instance function, missing in [6]) that gives some control over the precision and computational cost of the resulting generic structural domain.