Learning Combinatorial Interaction Test Generation Strategies Using Hyperheuristic Search

The surge of search based software engineering research has been hampered by the need to develop customized search algorithms for different classes of the same problem. For instance, two decades of bespoke Combinatorial Interaction Testing (CIT) algorithm development, our exemplar problem, has left software engineers with a bewildering choice of CIT techniques, each specialized for a particular task. This paper proposes the use of a single hyperheuristic algorithm that learns search strategies across a broad range of problem instances, providing a single generalist approach. We have developed a Hyperheuristic algorithm for CIT, and report experiments that show that our algorithm competes with known best solutions across constrained and unconstrained problems: For all 26 real-world subjects, it equals or outperforms the best result previously reported in the literature. We also present evidence that our algorithm's strong generic performance results from its unsupervised learning. Hyperheuristic search is thus a promising way to relocate CIT design intelligence from human to machine

Practical Combinatorial Interaction Testing: Empirical Findings on Efficiency and Early Fault Detection

Combinatorial interaction testing (CIT) is important because it tests the interactions between the many features and parameters that make up the configuration space of software systems. Simulated Annealing (SA) and Greedy Algorithms have been widely used to find CIT test suites. From the literature, there is a widely-held belief that SA is slower, but produces more effective tests suites than Greedy and that SA cannot scale to higher strength coverage. We evaluated both algorithms on seven real-world subjects for the well-studied two-way up to the rarely-studied six-way interaction strengths. Our findings present evidence to challenge this current orthodoxy: real-world constraints allow SA to achieve higher strengths. Furthermore, there was no evidence that Greedy was less effective (in terms of time to fault revelation) compared to SA; the results for the greedy algorithm are actually slightly superior. However, the results are critically dependent on the approach adopted to constraint handling. Moreover, we have also evaluated a genetic algorithm for constrained CIT test suite generation. This is the first time strengths higher than 3 and constraint handling have been used to evaluate GA. Our results show that GA is competitive only for pairwise testing for subjects with a small number of constraints

HyperGI: Automated Detection and Repair of Information Flow Leakage

Maintaining confidential information control in soft-ware is a persistent security problem where failure means secrets can be revealed via program behaviors. Information flow control techniques traditionally have been based on static or symbolic analyses — limited in scalability and specialized to particular languages. When programs do leak secrets there are no approaches to automatically repair them unless the leak causes a functional test to fail. We present our vision for HyperGI, a genetic improvement framework that detects, localizes and repairs information leakage. Key elements of HyperGI include (1) the use of two orthogonal test suites, (2) a dynamic leak detection approach which estimates and localizes potential leaks, and (3) a repair component that produces a candidate patch using genetic improvement. We demonstrate the successful use of HyperGI on several programs with no failing functional test cases. We manually examine the resulting patches and identify trade-offs and future directions for fully realizing our vision

Turning points: the personal and professional circumstances that lead academics to become middle managers

In the current higher education climate, there is a growing perception that the pressures associated with being an academic middle manager outweigh the perceived rewards of the position. This article investigates the personal and professional circumstances that lead academics to become middle managers by drawing on data from life history interviews undertaken with 17 male and female department heads from a range of disciplines, in a post-1992 UK university. The data suggests that experiencing conflict between personal and professional identities, manifested through different socialization experiences over time, can lead to a ‘turning point’ and a decision that affects a person’s career trajectory. Although the results of this study cannot be generalized, the findings may help other individuals and institutions move towards a firmer understanding of the academic who becomes head of department—in relation to theory, practice and research

Hybrid Algorithms Based on Integer Programming for the Search of Prioritized Test Data in Software Product Lines

In Software Product Lines (SPLs) it is not possible, in general, to test all products of the family. The number of products denoted by a SPL is very high due to the combinatorial explosion of features. For this reason, some coverage criteria have been proposed which try to test at least all feature interactions without the necessity to test all products, e.g., all pairs of features (pairwise coverage). In addition, it is desirable to first test products composed by a set of priority features. This problem is known as the Prioritized Pairwise Test Data Generation Problem. In this work we propose two hybrid algorithms using Integer Programming (IP) to generate a prioritized test suite. The first one is based on an integer linear formulation and the second one is based on a integer quadratic (nonlinear) formulation. We compare these techniques with two state-of-the-art algorithms, the Parallel Prioritized Genetic Solver (PPGS) and a greedy algorithm called prioritized-ICPL. Our study reveals that our hybrid nonlinear approach is clearly the best in both, solution quality and computation time. Moreover, the nonlinear variant (the fastest one) is 27 and 42 times faster than PPGS in the two groups of instances analyzed in this work.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech. Partially funded by the Spanish Ministry of Economy and Competitiveness and FEDER under contract TIN2014-57341-R, the University of Málaga, Andalucía Tech and the Spanish Network TIN2015-71841-REDT (SEBASENet)

Effects of religious vs. standard cognitive behavioral therapy on therapeutic alliance: A randomized clinical trial

Background: Treatments that integrate religious clients' beliefs into therapy may enhance the therapeutic alliance (TA) in religious clients. Objective: Compare the effects of religiously integrated cognitive behavioral therapy (RCBT) and standard CBT (SCBT) on TA in adults with major depression and chronic medical illness. Method: Multi-site randomized controlled trial in 132 participants, of whom 108 (SCBT = 53, RCBT = 55) completed the Revised Helping Alliance Questionnaire (HAQ-II) at 4, 8, and 12 weeks. Trajectory of change in scores over time was compared between groups. Results: HAQ-II score at 4 weeks predicted a decline in depressive symptoms over time independent of treatment group (B = −0.06, SE = 0.02, p = 0.002, n = 108). There was a marginally significant difference in HAQ-II scores at 4 weeks that favored RCBT (p = 0.076); however, the mixed effects model indicated a significant group by time interaction that favored the SCBT group (B = 1.84, SE = 0.90, degrees of freedom = 181, t = 2.04, p = 0.043, d = 0.30). Conclusions: While RCBT produces a marginally greater improvement in TA initially compared with SCBT, SCBT soon catches up

Synthesising interprocedural bit-precise termination proofs

Proving program termination is key to guaranteeing absence of undesirable behaviour, such as hanging programs and even security vulnerabilities such as denial-of-service attacks. To make termination checks scale to large systems, interprocedural termination analysis seems essential, which is a largely unexplored area of research in termination analysis, where most effort has focussed on difficult single-procedure problems. We present a modular termination analysis for C programs using template-based interprocedural summarisation. Our analysis combines a context-sensitive, over-approximating forward analysis with the inference of under-approximating preconditions for termination. Bit-precise termination arguments are synthesised over lexicographic linear ranking function templates. Our experimental results show that our tool 2LS outperforms state-of-the-art alternatives, and demonstrate the clear advantage of interprocedural reasoning over monolithic analysis in terms of efficiency, while retaining comparable precision

The first-year growth response to growth hormone treatment predicts the long-term prepubertal growth response in children

<p>Abstract</p> <p>Background</p> <p>Pretreatment auxological variables, such as birth size and parental heights, are important predictors of the growth response to GH treatment. For children with missing pretreatment data, published prediction models cannot be used.</p> <p>The objective was to construct and validate a prediction model for children with missing background data based on the observed first-year growth response to GH. The accuracy and reliability of the model should be comparable with our previously published prediction model relying on pretreatment data. The design used was mathematical curve fitting on observed growth response data from children treated with a GH dose of 33 μg/kg/d.</p> <p>Methods</p> <p>Growth response data from 162 prepubertal children born at term were used to construct the model; the group comprised of 19% girls, 80% GH-deficient and 23% born SGA. For validation, data from 205 other children fulfilling the same inclusion and treatment criteria as the model group were used. The model was also tested on data from children born prematurely, children from other continents and children receiving a GH dose of 67 μg/kg/d.</p> <p>Results</p> <p>The GH response curve was similar for all children, but with an individual amplitude. The curve SD score depends on an individual factor combining the effect of dose and growth, the 'Response Score', and time on treatment, making prediction possible when the first-year growth response is known. The prediction interval (± 2 SD_res) was ± 0.34 SDS for the second treatment year growth response, corresponding to ± 1.2 cm for a 3-year-old child and ± 1.8 cm for a 7-year-old child. For the 1–4-year prediction, the SD_reswas 0.13 SDS/year and for the 1–7-year prediction it was 0.57 SDS (i.e. < 0.1 SDS/year).</p> <p>Conclusion</p> <p>The model based on the observed first-year growth response on GH is valid worldwide for the prediction of up to 7 years of prepubertal growth in children with GHD/ISS, born AGA/SGA and born preterm/term, and can be used as an aid in medical decision making.</p

Applying scale-invariant dynamics to improve consensus achievement of agents in motion

In order to efficiently execute tasks, autonomous collective systems are required to rapidly reach accurate consensus, no matter how the group is distributed over the environment. Finding consensus in a group of agents that are in motion is a particularly great challenge, especially at larger scales and extensive environments. Nevertheless, numerous collective systems in nature reach consensus independently of scale, i.e. they are scale-free or scale-invariant. Inspired by these natural phenomena, the aim of our work is to improve consensus achievement in artificial systems by finding fundamental links between individual decision-making and scale-free collective behavior. For model validation we use physics-based simulations as well as a swarm robotic testbed