Generalization of the Language Version Determination Problem K.C. W o n g Department of Mathematical Sciences The University of Akron A k r o n , O H 44325 (216) 375-7193 (RiKW@AKRONVM) Abstract In this paper, we generalize the language version determination problem by relaxing the assumption of version subset relationship. The search algorithms proposed for the generalized problem involve constant search time using a hash table to implement the search for language versions. The hash table stores version features and their corresponding versions containing them. Maintaining the hash table is done by inserting newly developed versions in the version lists corresponding to those features newly added and those contained in the versions from which the new versions are developed, excluding the features being deleted. 1. I n t r o d u c t i o n Resource redundancy in a network based environment plays a central role in promoting system reliability [1-9]. In the environment, multiple versions of a particular high-level language may be distributively implemented on various nodes. When a system user tries to compile a program written in a particular version, she/he has to first determine what language version was used to write the
/lp/association-for-computing-machinery/generalization-of-the-language-version-determination-problem-ARea0fIZhM