{'fraction_non_alphanumeric': 0.017955801104972375, 'fraction_numerical': 0.0055248618784530384, 'mean_word_length': 5.590909090909091, '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}}
Improving structural FSM traversal by constraint-satisfying logic simulation

We increase the reasoning power of the Record & Play algorithm for structural FSM traversal (Stoffel and Kunz, 1997), by incorporating a constraint-satisfying simulation technique. Combinational verification tools often use simulation to identify candidates for internally equivalent functions. This can significantly reduce the computational costs of proving the equivalence of two circuits. The key idea to improve Record & Play is to perform a random simulation in every time frame that satisfies stored equivalences and constants which are needed to represent the state set. Our experimental results show the benefit of the proposed approach.