{'fraction_non_alphanumeric': 0.04318936877076412, 'fraction_numerical': 0.007751937984496124, 'mean_word_length': 5.457142857142857, '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}}
Research Proposal Efficient Algorithms for the Runtime Environment of Object Oriented Languages

Theobject oriented(OO) paradigm has become the norm for software development. OO languages, such as C++ [58], J AVA [4], EIFFEL [43], and SMALLTALK ’s [33], are used in almost every software project. The OO programming style, and the languages that enable it, have acquired an aura of respectability. OO programming promotes reusability, extendibility, reliability, and portability. But this come at a cost of runtime efficiency. This proposed research is to find efficient algorithms for (at least) four problems: subtyping tests, single dispatching, multiple dispatching, and object layout. It is important to note that although the problems take variations in different languages, these variations are minor. Our results will therefore be of general interest, and applicable to many different languages.