A framework and tool support for the systematic testing of model-based specifications

Formal specifications can precisely and unambiguously define the required behavior of a software system or component. However, formal specifications are complex artifacts that need to be verified to ensure that they are consistent, complete, and validated against the requirements. Specification testing or animation tools exist to assist with this by allowing the specifier to interpret or execute the specification. However, currently little is known about how to do this effectively. This article presents a framework and tool support for the systematic testing of formal, model-based specifications. Several important generic properties that should be satisfied by model-based specifications are first identified. Following the idea of mutation analysis, we then use variants or mutants of the specification to check that these properties are satisfied. The framework also allows the specifier to test application-specific properties. All properties are tested for a range of states that are defined by the tester in the form of a testgraph, which is a directed graph that partially models the states and transitions of the specification being tested. Tool support is provided for the generation of the mutants, for automatically traversing the testgraph and executing the test cases, and for reporting any errors. The framework is demonstrated on a small specification and its application to three larger specifications is discussed. Experience indicates that the framework can be used effectively to test small to medium-sized specifications and that it can reveal a significant number of problems in these specifications.

Viewpoint-based testing of concurrent components

The use of multiple partial viewpoints is recommended for specification. We believe they also can be useful for devising strategies for testing. In this paper, we use Object-Z to formally specify concurrent Java components from viewpoints based on the separation of application and synchronisation concerns inherent in Java monitors. We then use the Test-Template Framework on the Object-Z viewpoints to devise a strategy for testing the components. When combining the test templates for the different viewpoints we focus on the observable behaviour of the application to systematically derive a practical testing strategy. The Producer-Consumer and Readers-Writers problems are considered as case studies.

On a resampling approach for tests on the number of clusters with mixture model-based clustering of tissue samples

We consider the problem of assessing the number of clusters in a limited number of tissue samples containing gene expressions for possibly several thousands of genes. It is proposed to use a normal mixture model-based approach to the clustering of the tissue samples. One advantage of this approach is that the question on the number of clusters in the data can be formulated in terms of a test on the smallest number of components in the mixture model compatible with the data. This test can be carried out on the basis of the likelihood ratio test statistic, using resampling to assess its null distribution. The effectiveness of this approach is demonstrated on simulated data and on some microarray datasets, as considered previously in the bioinformatics literature. (C) 2004 Elsevier Inc. All rights reserved.

Speeding up the EM algorithm for mixture model-based segmentation of magnetic resonance images

Mixture models implemented via the expectation-maximization (EM) algorithm are being increasingly used in a wide range of problems in pattern recognition such as image segmentation. However, the EM algorithm requires considerable computational time in its application to huge data sets such as a three-dimensional magnetic resonance (MR) image of over 10 million voxels. Recently, it was shown that a sparse, incremental version of the EM algorithm could improve its rate of convergence. In this paper, we show how this modified EM algorithm can be speeded up further by adopting a multiresolution kd-tree structure in performing the E-step. The proposed algorithm outperforms some other variants of the EM algorithm for segmenting MR images of the human brain. (C) 2004 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

The functions of societies and the evolution of group living: Spider societies as a test case

Many models have been advanced to suggest how different expressions of sociality have evolved and are maintained. However these models ignore the function of groups for the particular species in question. Here we present a new perspective on sociality where the function of the group takes a central role. We argue that sociality may have primarily a reproductive, protective, or foraging function, depending on whether it enhances the reproductive, protective or foraging aspect of the animal's life (sociality may serve a mixture of these functions). Different functions can potentially cause the development of the same social behaviour. By identifying which function influences a particular social behaviour we can determine how that social behaviour will change with changing conditions, and which models are most pertinent. To test our approach we examined spider sociality, which has often been seen as the poor cousin to insect sociality. By using our approach we found that the group characteristics of eusocial insects is largely governed by the reproductive function of their groups, while the group characteristics of social spiders is largely governed by the foraging function of the group. This means that models relevant to insects may not be relevant to spiders. It also explains why eusocial insects have developed a strict caste system while spider societies are more egalitarian. We also used our approach to explain the differences between different types of spider groups. For example, differences in the characteristics of colonial and kleptoparasitic groups can be explained by differences in foraging methods, while differences between colonial and cooperative spiders can be explained by the role of the reproductive function in the formation of cooperative spider groups. Although the interactions within cooperative spider colonies are largely those of a foraging society, demographic traits and colony dynamics are strongly influenced by the reproductive function. We argue that functional explanations help to understand the social structure of spider groups and therefore the evolutionary potential for speciation in social spiders.

Light alloy castings for automotive applications: The case of Al vs Mg

The economical and environmental effects of mass reduction through Al and Mg primary alloys substitutions for cast iron and steel in automotive components are discussed using MF. Ashby's penalty functions method The viability of Mg alloy substitutions for existing Al alloy cast components is also considered. The cost analysis shows that direct, equal-volume, Al alloy substitutions for cast iron and steel are the most feasible in terms of the CAFE liability, followed by substitutions involving flat panels of prescribed stiffness. When the creation of CO2 associated to the production of Al and Mg is considered, the potential gasoline savings over the lifespan of the car compensate for the intrinsic environmental burden of Al in all applications, while electrolytic Mg substitutions for cast iron and steel are feasible for equal volume and panels only. Magnesium produced by the Pidgeon thermal process appears to be too primary energy intensive to be competitive in structural applications. Magnesium substitutions for existing Al alloy beams and panels are generally unviable. The current higher recycling efficiency of Al casting alloys confers Al a significant advantage over Mg alloys.

Right ventricle extraction by low level and model-based algorithm

In this paper we present an algorithm as the combination of a low level morphological operation and model based Global Circular Shortest Path scheme to explore the segmentation of the Right Ventricle. Traditional morphological operations were employed to obtain the region of interest, and adjust it to generate a mask. The image cropped by the mask is then partitioned into a few overlapping regions. Global Circular Shortest Path algorithm is then applied to extract the contour from each partition. The final step is to re-assemble the partitions to create the whole contour. The technique is deemed quite reliable and robust, as this is illustrated by a very good agreement between the extracted contour and the expert manual drawing output.