{'fraction_non_alphanumeric': 0.011890606420927468, 'fraction_numerical': 0.0, 'mean_word_length': 5.1911764705882355, '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}}
Verification of Timed Algorithms: Gurevich Abstract State Machines versus First Order Timed Logic

We give a survey of our recent and current work on the specification and verification of timed algorithms within a rather complete logical framework where timed Gurevich Abstract State Machines (GASM) are used to specify algorithms. The time we use is continuous as it is usual in specifications of control systems and often of protocols (discrete time can be treated within the same framework but it is less intuitive and harder to treat when automating the verification process). The topics addressed in this survey concern semantics of timed GASM, representation of this semantics in a first order logic adapted to verification, heuristic considerations that are implied by the used type of GASM and that help to automate the verification.