123,063 research outputs found
FORTEST: Formal methods and testing
Formal methods have traditionally been used for specification and development of software. However there are potential benefits for the testing stage as well. The panel session associated with this paper explores the usefulness
or otherwise of formal methods in various contexts for improving software testing. A number of different possibilities for the use of formal methods are explored and questions raised. The contributors are all members of the UK FORTEST Network on formal methods and testing. Although
the authors generally believe that formal methods
are useful in aiding the testing process, this paper is intended to provoke discussion. Dissenters are encouraged to put their views to the panel or individually to the authors
An empirical investigation into branch coverage for C programs using CUTE and AUSTIN
Automated test data generation has remained a topic of considerable interest for several decades because it lies at the heart of attempts to automate the process of Software Testing. This paper reports the results of an empirical study using the dynamic symbolic-execution tool. CUTE, and a search based tool, AUSTIN on five non-trivial open source applications. The aim is to provide practitioners with an assessment of what can be achieved by existing techniques with little or no specialist knowledge and to provide researchers with baseline data against which to measure subsequent work. To achieve this, each tool is applied 'as is', with neither additional tuning nor supporting harnesses and with no adjustments applied to the subject programs under test. The mere fact that these tools can be applied 'out of the box' in this manner reflects the growing maturity of Automated test data generation. However, as might be expected, the study reveals opportunities for improvement and suggests ways to hybridize these two approaches that have hitherto been developed entirely independently. (C) 2010 Elsevier Inc. All rights reserved
Evolving Gene Regulatory Networks with Mobile DNA Mechanisms
This paper uses a recently presented abstract, tuneable Boolean regulatory
network model extended to consider aspects of mobile DNA, such as transposons.
The significant role of mobile DNA in the evolution of natural systems is
becoming increasingly clear. This paper shows how dynamically controlling
network node connectivity and function via transposon-inspired mechanisms can
be selected for in computational intelligence tasks to give improved
performance. The designs of dynamical networks intended for implementation
within the slime mould Physarum polycephalum and for the distributed control of
a smart surface are considered.Comment: 7 pages, 8 figures. arXiv admin note: substantial text overlap with
arXiv:1303.722
Searching for invariants using genetic programming and mutation testing
Invariants are concise and useful descriptions of a program's behaviour. As most programs are not annotated with invariants, previous research has attempted to automatically generate them from source code. In this paper, we propose a new approach to invariant generation using search. We reuse the trace generation front-end of existing tool Daikon and integrate it with genetic programming and a mutation testing tool. We demonstrate that our system can find the same invariants through search that Daikon produces via template instantiation, and we also find useful invariants that Daikon does not. We then present a method of ranking invariants such that we can identify those that are most interesting, through a novel application of program mutation
The impact of cellular characteristics on the evolution of shape homeostasis
The importance of individual cells in a developing multicellular organism is
well known but precisely how the individual cellular characteristics of those
cells collectively drive the emergence of robust, homeostatic structures is
less well understood. For example cell communication via a diffusible factor
allows for information to travel across large distances within the population,
and cell polarisation makes it possible to form structures with a particular
orientation, but how do these processes interact to produce a more robust and
regulated structure? In this study we investigate the ability of cells with
different cellular characteristics to grow and maintain homeostatic structures.
We do this in the context of an individual-based model where cell behaviour is
driven by an intra-cellular network that determines the cell phenotype. More
precisely, we investigated evolution with 96 different permutations of our
model, where cell motility, cell death, long-range growth factor (LGF),
short-range growth factor (SGF) and cell polarisation were either present or
absent. The results show that LGF has the largest positive impact on the
fitness of the evolved solutions. SGF and polarisation also contribute, but all
other capabilities essentially increase the search space, effectively making it
more difficult to achieve a solution. By perturbing the evolved solutions, we
found that they are highly robust to both mutations and wounding. In addition,
we observed that by evolving solutions in more unstable environments they
produce structures that were more robust and adaptive. In conclusion, our
results suggest that robust collective behaviour is most likely to evolve when
cells are endowed with long range communication, cell polarisation, and
selection pressure from an unstable environment
Adventures in Time and Space: What Shapes Behavioural Decisions in Drosophila melanogaster?
Variation in behaviour can be observed both between individuals, based on their condition and experience as well as between populations due to sources of heterogeneity in the environment. These behavioural differences have evolved as a result of natural and sexual selection where different strategies may be favoured depending on the costs and benefits associated with those behaviours. In this thesis I examine two sources of heterogeneity within the environment and their behavioural consequences: how spatial complexity mediates sexual selection over time, and how inter and intraspecific signals and individual condition influence social oviposition behaviour. By increasing spatial complexity, we were able to manipulate male-female interaction rate which in turn influenced courtship behaviour and male-induced harm, the consequence of this was an increase in female fecundity especially in the later days of the assay and no change in offspring fitness. These results supported the idea that spatial complexity is able to mediate sexual selection through decreased harm to females. Oviposition decisions are of high consequence to an individualās fitness and can be shaped by many environmental conditions. Instead of expending energy to evaluate all their different costs and benefits of the conditions of potential oviposition sites females can chose to rely on the signals left by others, in this case it would be beneficial for females to identify signals most like themselves. While we found females oviposited with individuals of the same species and diet, when given the option they showed more interest in and laid more eggs on media that previously held virgin males, bringing into question many assumptions of copying behaviour. In Drosophila melanogaster the only control females have over their offspring is who they mate with and where they oviposit their eggs, thus, these two factors can have a long-lasting impact on individual fitness for future generations. It is also important to consider how the standard lab environment may be shaping these behaviours, and the consequences this has for the evolutionary trajectory of lab populations
Genetic algorithms with self-organizing behaviour in dynamic environments
Copyright @ 2007 Springer-VerlagIn recent years, researchers from the genetic algorithm (GA) community have developed several approaches to enhance the performance of traditional GAs for dynamic optimization problems (DOPs). Among these approaches, one technique is to maintain the diversity of the population by inserting random immigrants into the population. This chapter investigates a self-organizing random immigrants scheme for GAs to address DOPs, where the worst individual and its next neighbours are replaced by random immigrants. In order to protect the newly introduced immigrants from being replaced by fitter individuals, they are placed in a subpopulation. In this way, individuals start to interact between themselves and, when the fitness of the individuals are close, one single replacement of an individual can affect a large number of individuals of the population in a chain reaction. The individuals in a subpopulation are not allowed to be replaced by individuals of the main population during the current chain reaction. The number of individuals in the subpopulation is given by the number of individuals created in the current chain reaction. It is important to observe that this simple approach can take the system to a self-organization behaviour, which can be useful for GAs in dynamic environments.Financial support was obtained from FAPESP (Proc. 04/04289-6)
A Study in function optimization with the breeder genetic algorithm
Optimization is concerned with the finding of global optima
(hence the name) of problems that can be cast in the form of a
function of several variables and constraints thereof. Among the
searching methods, {em Evolutionary Algorithms} have been shown to be
adaptable and general tools that have often outperformed traditional
{em ad hoc} methods. The {em Breeder Genetic Algorithm} (BGA)
combines a direct representation with a nice conceptual
simplicity. This work contains a general description of the algorithm
and a detailed study on a collection of function optimization
tasks. The results show that the BGA is a powerful and reliable
searching algorithm. The main discussion concerns the choice of
genetic operators and their parameters, among which the family of
Extended Intermediate Recombination (EIR) is shown to stand out. In
addition, a simple method to dynamically adjust the operator is
outlined and found to greatly improve on the already excellent overall
performance of the algorithm.Postprint (published version
- ā¦