{'fraction_non_alphanumeric': 0.01818181818181818, 'fraction_numerical': 0.014545454545454545, 'mean_word_length': 5.261363636363637, '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}}
Partial model checking and theorem proving for ensuring security properties

The author presents a methodology based on known techniques in concurrency and process logics theory for ensuring information flow security properties, similar to the ones proposed by Focardi and Gorrieri (1995, 1997). Recently, they have shown that concepts from information flow theory can be used in the analysis of authentication protocols. This kind of problem may be tackled by his methodology. This has been implemented over mudiv, a tool for partial model checking.