This paper presents a concept of component verification framework dedicated to a particular lightweight component environment. The starting point of the paper constitutes a discussion about the significance of verification of syntax inconsistencies in software development. Next, the need of verification in service-oriented and component-based systems is presented, and various approaches of verification in existing component environments are explained. The main part of the paper introduces a concept of functional integrity of component-based systems that utilize verification mechanisms which check consistency between components. The proposed solution is built on a fine-grained component environment (close to classes similarly to the Spring Framework) realized in the AgE platform. Selected technical aspects of framework design illustrate the considerations of the paper.
This paper contributes to solving the low autocorrelation binary sequence (LABS) problem that remains an open hard-optimization problem with many applications. The current direction of research is focused on developing algorithms dedicated to parallel architectures such as GPGPU or multi-core CPUs. The paper follows this direction and proposes new heuristics developed from the steepest-descent local search algorithm that extends the notion of a neighborhood of a given sequence. The introduced algorithms utilize the parallel nature of multicore CPUs and provide an effective method for solving the LABS problem. The efficiency levels of SDSL and the new algorithm are presented; to ensure an effective comparison, they were both implemented in the same manner. The comparison shows that exploring the larger neighborhood improves the efficiency of the search method.
