DSpot: Test Amplification for Automatic Assessment of Computational Diversity

Context: Computational diversity, i.e., the presence of a set of programs that all perform compatible services but that exhibit behavioral differences under certain conditions, is essential for fault tolerance and security. Objective: We aim at proposing an approach for automatically assessing the presence of computational diversity. In this work, computationally diverse variants are defined as (i) sharing the same API, (ii) behaving the same according to an input-output based specification (a test-suite) and (iii) exhibiting observable differences when they run outside the specified input space. Method: Our technique relies on test amplification. We propose source code transformations on test cases to explore the input domain and systematically sense the observation domain. We quantify computational diversity as the dissimilarity between observations on inputs that are outside the specified domain. Results: We run our experiments on 472 variants of 7 classes from open-source, large and thoroughly tested Java classes. Our test amplification multiplies by ten the number of input points in the test suite and is effective at detecting software diversity. Conclusion: The key insights of this study are: the systematic exploration of the observable output space of a class provides new insights about its degree of encapsulation; the behavioral diversity that we observe originates from areas of the code that are characterized by their flexibility (caching, checking, formatting, etc.).Comment: 12 page

Prediction of jet engine parameters for control design using genetic programming

The simulation of a jet engine behavior is widely used in many different aspects of the engine development and maintenance. Achieving high quality jet engine control systems requires the iterative use of these simulations to virtually test the performance of the engine avoiding any possible damage on the real engine. Jet engine simulations involve the use of mathematical models which are complex and may not always be available. This paper introduces an approach based on Genetic Programming (GP) to model different parameters of a small engine for control design such as the Exhaust Gas Temperature (EGT). The GP approach has no knowledge of the characteristics of the engine. Instead, the model is found by the evolution of models based on past measurements of parameters such as the pump voltage. Once the model is obtained, it is used to predict the behaviour of the jet engine one step ahead. The proposed approach is successfully applied for the simulation of a Behotec j66 jet engine and the results are presented

A novel approach for ANFIS modelling based on Grey system theory for thermal error compensation

The fast and accurate modelling of thermal errors in machining is an important aspect for the implementation of thermal error compensation. This paper presents a novel modelling approach for thermal error compensation on CNC machine tools. The method combines the Adaptive Neuro Fuzzy Inference System (ANFIS) and Grey system theory to predict thermal errors in machining. Instead of following a traditional approach, which utilises original data patterns to construct the ANFIS model, this paper proposes to exploit Accumulation Generation Operation (AGO) to simplify the modelling procedures. AGO, a basis of the Grey system theory, is used to uncover a development tendency so that the features and laws of integration hidden in the chaotic raw data can be sufficiently revealed. AGO properties make it easier for the proposed model to design and predict. According to the simulation results, the proposed model demonstrates stronger prediction power than standard ANFIS model only with minimum number of training samples

Symbolic regression of generative network models

Networks are a powerful abstraction with applicability to a variety of scientific fields. Models explaining their morphology and growth processes permit a wide range of phenomena to be more systematically analysed and understood. At the same time, creating such models is often challenging and requires insights that may be counter-intuitive. Yet there currently exists no general method to arrive at better models. We have developed an approach to automatically detect realistic decentralised network growth models from empirical data, employing a machine learning technique inspired by natural selection and defining a unified formalism to describe such models as computer programs. As the proposed method is completely general and does not assume any pre-existing models, it can be applied "out of the box" to any given network. To validate our approach empirically, we systematically rediscover pre-defined growth laws underlying several canonical network generation models and credible laws for diverse real-world networks. We were able to find programs that are simple enough to lead to an actual understanding of the mechanisms proposed, namely for a simple brain and a social network

New results on the genetic cryptanalysis of TEA and reduced-round versions of XTEA

Congress on Evolutionary Computation. Portland, USA, 19-23 June 2004Recently, a simple way of creating very efficient distinguishers for cryptographic primitives such as block ciphers or hash functions, was presented by the authors. Here, this cryptanalysis attack is shown to be successful when applied over reduced round versions of the block cipher XTEA. Additionally, a variant of this genetic attack is introduced and its results over TEA shown to be the most powerful published to date