{'fraction_non_alphanumeric': 0.014729950900163666, 'fraction_numerical': 0.0, 'mean_word_length': 5.8, '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}}
Information Flow Analysis via Equational Reasoning

In this work, a process algebra is designed around an ACUID equational theory extended with prefixes symbolizing actions, and by making parallel synchronous composition distributive over non-deterministic choice; such a synchronous composition is commutative and non-associative. Bisimulation between processes is then interpretable as congruence over such an equational theory. It is shown that information flow analysis is strictly finer when based on bisimulation on the synchronous algebra, than when it is based on trace or weak bisimulation equivalence.