{'fraction_non_alphanumeric': 0.032467532467532464, 'fraction_numerical': 0.00487012987012987, 'mean_word_length': 4.876190476190477, '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 Lock-free Scalable Synchronous Queue ( Technical Report )

Lock-free algorithms are extremely hard to be built correct due to their fine-grained concurrency natures. Formal frameworks for verifying them are crucial. In this paper we present a framework for verification of CAS-based lock-free algorithms, based on RGSep [25]. As an example, we prove a nontrivial lock-free algorithm that is practically adopted in Java 6. The strength of our method lies on that it completely rules out auxiliary variables/commands, thus is relatively easier to conduct and comprehend, comparing to the existing work.