{'fraction_non_alphanumeric': 0.027210884353741496, 'fraction_numerical': 0.0027210884353741495, 'mean_word_length': 6.076923076923077, '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}}
Mutual Exclusion Verification of Parameterized Reader-Writer Algorithm: A Case Study

This paper presents the verification of mutual-exclusion properties of parameterized reader-writer algorithm. A class of diagram called Predicate diagrams [1] is used for representing the abstractions of parameterized systems described by specifications written in TLA. The verification is done by integrating deductive verification and algorithmic techniques. The correspondence between the original specification and the diagram is established by non-temporal proof obligations. Whereas model checker SPIN [3] is used to verify properties over finite-state abstractions. Keywords: formal method, verification, parameterized system, temporal logic.