Granule-oriented programming

Abstract

A program will become obsolete or lower effectiveness in solving domain problems due to many reasons. One main reason is because the program becomes unfitting to its context, which is defined as a sum of functionalities of all what support the program solving the domain problems, for instance, a runtime environment, meta-strategies in the domain, etc. This unfitting phenomenon exists in many complex systems, causing them premature end of their life cycle or a decrease in performance or accuracy in solving problems. In existing programming systems we pay little attention to unfitness of a program to its context, in language expressivity. Granule-oriented programming is an evolvement metaphor in which programs are "ground" into code ingredients in order to localize unfitting parts of a program as explicitly as possible, and then "compound" them into granular output code in which the code granulation space is formed. Code granulation space is an expression of a program in multiple-abstraction framework. The goal of building code granulation space for a program is to localize unfitness in a well-formed and multi-layered framework. In this paper, we propose and briefly describe the notion of granule-oriented programming.

An Object Proxy-Based Dynamic Layer Replacement to Protect IoMT Applications

“…Granule-oriented programming [19] uses fitness to determine which components are available for applications. In [12], predicate is applied to determine the applicability of context-specific methods.…”

“…However, there are some differences between them. Predicate in [19] is not formally defined while fitness in [12] and our approach is formally defined as a predicate method. Moreover, fitness in [12] is applied to select context-specific methods of composed classes while predicate in our approach is applied to select context-specific methods of composed objects.…”

A step toward code granulation space

“…Traditional methodologies for program construction deal with both data and code successfully in modularity, while still have fitness problems with them [1]. As an alternative to general problem solving methodologies, granular computing is emerged as a promise perspective in data organizing and processing [2,3].…”

“…The fitness of computer program [1] reflects some changes from time to time during the life cycle of programs. Those changes have an impact on the execution of the programs.…”

Calculus Using Fitness Testing for Method Redirection

“…• 基于上下文的方法查找 我们首先扩展层的定义:每个层都包含一种谓词方法 fitness.它描述一个特定上下文,并用于判断当前的上 下文是否匹配这一特定上下文 [10] .如果 fitness 返回 true,则匹配,层中的方法可用于当前的上下文;否则,不可以.…”