{'fraction_non_alphanumeric': 0.016574585635359115, 'fraction_numerical': 0.0, 'mean_word_length': 5.176136363636363, '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}}
Temporal Deductive Veriﬁcation of Basic ASM Models

Abstract State Machines (ASMs, for short) provide a practical new computational model  which has been applied in the area of software engineering for systems design and analysis. However, reasoning about ASM models occurs, not within a formal deductive system, but basically in the classical informal proofs style of mathematics. Several formal veriﬁcation approaches for proving correctness of ASM models have been investigated. In this paper we consider the use of the TLA+logic for the deductive veriﬁcation of a certain class of ASMs, namely basic ASMs which have successfully been applied in describing the dynamic behavior of systems at various levels of abstraction. In particular, we base our veriﬁcation purpose on a translation of basic ASMs to the Temporal Logic of Actions (TLA) used as a formal basis to formally specify and reason about temporal behaviors of basic ASM models. The temporal deductive approach is illustrated by the formal correctness proof of a producer-consumer system formalized in terms of basic ASMs.