Rossada T. Formalization, research and application of nomination methods in the program specification languages

The purpose of this paper is the analysis, formalization, and investigation of properties of nomination relation which are used today in specification (and programming) languages, but do not fit into the framework of the classical theory of nomination relation. Nominative data models with structured names, polysemy, synonymy, indirect addressing, and tolerance relation are constructed and studied. Semantic interpretations of a compositional-nominative language of executable specifications SiCoN over constructed data models are defined. For the constructed models stability of SiCoN specifications is proved with respect to substitution of equivalent data for the cases of data with synonymy, multi-valued naming, and polysemy. Monotonicity of SiCoN specification with respect to extension of input data is proved for data with multi-valued naming and polysemy. For a case of equivalence relation based on the initial equivalence of basic values with multi-valued naming, preservation of such equivalence by SiCoN specifications is proved. Predicate logic over data with indirect addressing and tolerance relation is defined. A program module for processing of relational nominative data is developed. The results of the dissertation can be used in program and information systems development.