{'fraction_non_alphanumeric': 0.00980392156862745, 'fraction_numerical': 0.0, 'mean_word_length': 5.008403361344538, '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}}
Specifying Concurrent Programs: a Case Study in JML and Separation Logic

This paper presents a case study for the verication of concurrent programs. A model for a central printer server was designed, implemented and annotated with a formal specication in JML, extended with syntax for permissionbased separation logic. The specication is compatible with the VerCors toolset which is currently being developed at the University of Twente. The goal of this research has been to design and implement a shared data structure with a formal specication that can be used to test future concurrent program veriers. The correctness of the program is discussed in natural language and an outline for a formal proof is given