{'fraction_non_alphanumeric': 0.019300361881785282, 'fraction_numerical': 0.0, 'mean_word_length': 5.2406015037593985, '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}}
Static Universe Type Inference using a SAT-Solver

The Universe type system allows to restrict the possible aliasing in object-oriented programs and thereby enables static reasoning about individual components. Compared to other ownership type systems, the Universe type system is lightweight, but annotating existing software is still a considerable effort. To ease the effort of annotation, static inference of Universe modifiers from Java source code is an interesting problem. In this work, we investigated the use of pseudo-boolean optimizers to find Universe annotations. To show the benefit of the new backend we implemented a new static Universe type inferer. The results reveal that also heavy annotated programs can be typed correctly. This report presents the architecture, implementation, and results of the new tool.