3217487
A Rule-Based Software Test Data Generator
Rule-based software test data generation is proposed as an alternative to either path/predicate analysis or random data generation. A prototype rule-based test data generator for Ada programs is constructed and compared to a random test data generator. Four Ada procedures are used in the comparison. Approximately 2000 rule-based test cases and 100000 randomly generated test cases are automatically generated and executed. The success of the two methods is compared using standard coverage metrics. Simple statistical tests showing that even the primitive rule-based test data generation prototype is significantly better than random data generation are performed. This result demonstrates that rule-based test data generation is feasible and shows great promise in assisting test engineers, especially when the rule base is developed further. >
1207779
Experience in Teaching a Management-Oriented Capstone Software Engineering Course
Many computer science departments teach a capstone software engineering course involving the design and implementation of a large-scale project. Such a course is normally taught with students working together in teams; consequently, students must face a number of problems related to project management and team dynamics. Our experience has been that students frequently fail to adequately cope with these organizational problems, and consequently fail to complete their projects at an acceptable level of quality. To prepare students to better face these problems, we have modified our capstone software engineering course to provide equal emphasis in both management and technical areas. Our approach to management topics is formal rather than anecdotal, stressing general principles applied to organizational problems arising specifically from situations that occur frequently in technical organizations. This paper reports on the structure of this course, and provides insight into our initial experience in teaching it.
317687
A Cost Model for Determining the Optimal Number of Software Test Cases
A probabilistic model is presented that demonstrates the optimal number of software test cases required in situations where the following can be estimated as independent parameters: (1) the cost per test; (2) the cost per error if undetected until field implementation; (3) the number of software executions over its lifetime; (4) the number of possible different executions; and (5) the number of faults embedded in the software. A formula is derived by the use of calculus and is solved by approximation techniques. Tables of the optimal number of tests over a range of parameter values are presented to illustrate the results. The model serves as a basis for further research efforts to improve the accuracy of input variable estimation. >
33488472
Expert System Assisted Test Data Generation for Software Branch Coverage
Abstract With the increased production of complex software systems, verification and validation (V & V) has evolved into a set of activities that span the entire software life cycle. Among these various activities, software testing plays a major role in V&V. Conventional software testing methods generally require considerable manual effort which can generate only a limited number of test cases before the amount of time expended becomes unacceptably large. In this paper, we present a new approach to generating test cases based on artificial intelligence methods. By analyzing the branch coverage of previous test cases, an expert system is able to generate new test cases which provide additional coverage. Heuristic rules are used to modify previous test cases in order to achieve the desired branch coverage. This approach to software testing has the potential for greatly reducing the overall costs associated with branch coverage testing.
3504482
An Intelligent Test Data Generator for Software Branch Coverage
14384022
Designing semantics-preserving cluster representatives for scientific input conditions
In scientific domains, knowledge is often discovered from experiments by grouping or clustering them based on the similarity of their output. The causes of similarity are analyzed based on the input conditions characterizing a given type of output, i.e., a given cluster. This analysis helps in applications such as decision support in industry. Cluster representatives form at-a-glance depictions for such applications. Randomly selecting a set of conditions in a cluster as its representative is not sufficient since distinct combinations of inputs could lead to the same cluster. In this paper, an approach called DesCond is proposed to design semantics-preserving cluster representatives for scientific input conditions. We define a notion of distance for conditions to capture semantics based on the types of their attributes and their relative importance. Using this distance, methods of building candidate cluster representatives with different levels of detail are proposed. Candidates are compared using the DesCond Encoding proposed in this paper that assesses their complexity and information loss, given user interests. The candidate with the lowest encoding for each cluster is returned as its designed representative. DesCond is evaluated with real data from Materials Science. Evaluation with domain expert interviews and formal user surveys shows that designed representatives consistently outperform randomly selected ones and different candidates suit different users.
14214005
Incorporating a Metropolis method in a distribution estimation using Markov random field algorithm
Markov random field (MRF) modelling techniques have been recently proposed as a novel approach to probabilistic modelling for estimation of distribution algorithms (EDAs) (S. K. Shakya et al., 2004). An EDA using this technique was called distribution estimation using Markov random fields (DEUM). DEUM was later extended to DEUM/sub d/ (S. Shakya et al., 2005). DEUM and DEUM/sub d/ use a univariate model of probability distribution, and have been shown to perform better than other univariate EDAs for a range of optimization problems. This paper extends DEUM/sub d/ to incorporate a simple Metropolis method and empirically shows that for linear univariate problems the proposed univariate MRF models are very effective. In particular, the proposed DEUM/sub d/ algorithm can find the solution in O(n) fitness evaluations. Furthermore, we suggest that the Metropolis method can also be used to extend the DEUM approach to multivariate problems.
34635988
Virtual Travel Training for People with Learning Disabilities Accessing Employment Including the Introduction to the Special Thematic Session "Virtual Reality"
The purpose of this project is to develop a Virtual Learning Environment to assist in the travel training of a group of people with learning disabilities to enable them to gain access to training and employment opportunities. To achieve this a realistic Virtual Travel in Sutton Package will be developed to assist people with special needs to learn independent travel skills, and to assess the effectiveness of the software in achieving this aim.
33879094
Defining configuring
This paper is intended to serve as part of the context in which the other papers in this special issue should be read. Its main goal is to revisit the basic definition of the configuration task, on which many people depend, to show some of its flaws, and to point out how it shapes thinking about the problem. We are concerned about characterizing the reasoning processes used to produce a configuration.
14054763
The use of functional domains to improve transmembrane protein topology prediction
Transmembrane proteins affect vital cellular functions and pathogenesis, and are a focus of drug design. It is difficult to obtain diffraction quality crystals to study transmembrane protein structure. Computational tools for transmembrane protein topology prediction fill in the gap between the abundance of transmembrane proteins and the scarcity of known membrane protein structures. Their prediction accuracy is still inadequate: TMHMM, the current state-of-the-art method, has less than 52% accuracy in topology prediction on one set of transmembrane proteins of known topology. Based on the observation that there are functional domains that occur preferentially internal or external to the membrane, we have extended the model of TMHMM to incorporate functional domains, using a probabilistic approach originally developed for computational gene finding. Our extension is better than TMHMM in predicting the topology of transmembrane proteins. As prediction of functional domain improves, our system's prediction accuracy will likely improve as well.