{'fraction_non_alphanumeric': 0.009358288770053475, 'fraction_numerical': 0.0, 'mean_word_length': 5.456896551724138, '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}}
Using Symbolic Simulation for Bounded Property Checking

Assuring correctness of digital designs is one of the major tasks in the system design flow. Formal methods have been proposed to accompany commonly used simulation approaches. In this paper we describe a new technique of property checking using symbolic simulation which can be applied to larger designs. This technique seamlessly integrate formal verification and standard simulation. The proposed method is a formal verification technique which checks symbolically a given LTL specification against the Hardware Design. Our experimental results show a run time gain over standard symbolic model checking and SAT-based bounded model checking for certain classes of circuits and properties.