Test Cases

In this paper we present our original approach to the model-based statistical usage testing of a class of communication protocol implementations that are based on the State design pattern and Java programming environment augmented with the class FSMSystem. The approach is based on the working environment that has been proven on a number of real-world projects. The working environment is created with the following set of tools: generic modeling environment with the operational profile model paradigm registered to it, operational profile model interpreter, generic test case generator, test case compiler, and the unit testing framework JUnit extended with the class TestBed that acts as both test driver and stub thus providing the complete test harness. In the paper we present the methodology of the model-based statistical usage testing of a class of communication protocol implementations, the tools that support this methodology, and the case study -the model based statistical usage testing of SIP INVITE client transaction, a part of the SIP protocol stack.

Answer : It just has to work and be maintained. There are too many things that can go wrong with a system. Unless developer can guarantee that all systems will be perfect, developer also cannot guarantee the program in the sense of operation. Worse, today's programs are way too complicated and large for a company to catch everything. It is not that "It is not necessary for a program to be completely free of defects before it s delivered to customers " it is that "it is not always (99% of the time ) possible to deliver a defect free product to the customer which is of 100% quality, The reason could be many for this such as Huge & complex application , timelines , resource constraint , Frequent change control , lack of technology knowledge , and finally human error. Any one of these occurs , it will affect the product.

In the place of traditional principle of project management a strategic management philosophy is emerging fast in which writing better test cases also receive the widespread attention of all those interested in software project management and software testing. In the current scenario managing software is an important task in an IT industry. Not only managing IT project, but also it is need to develop quality software product for the customer. It includes the number of tasks and phases of the software project development.

There are several methods for automatic test case generation has been proposed in the past. But most of these techniques are structural testing techniques that require the understanding of the internal working of the program. There is less practical coverage of all testing techniques together. In this paper we conducted a literature study on all testing techniques together that are related to both Black and White box testing techniques, moreover we assume a case situation of Insurance premium calculation for driver and we derive the test cases and test data for white box testing methods such as Branch testing, Statement testing, Condition Coverage testing, multiple condition coverage testing, in the similar way we derive the test cases and test data for the black box testing methods such as: Equivalence partitioning and Boundary value analysis. The overall aim of this literature study is to clearly explain different testing techniques along with a case situation and their advantages.

With the advent of WWW and outburst in technology and software development, testing the software became a major concern. Due to the importance of the testing phase in a software development lifecycle, testing has been divided into graphical user interface (GUI) based testing, logical testing, integration testing, etc.GUI Testing has become very important as it provides more sophisticated way to interact with the software. The complexity of testing GUI increased over time. The testing needs to be performed in a way that it provides effectiveness, efficiency, increased fault detection rate and good path coverage. To cover all use cases and to provide testing for all possible (success/failure) scenarios the length of the test sequence is considered important. Intent of this paper is to study some techniques used for test case generation and process for various GUI based software applications.

The aim of this manuscript is to give a practical overview of meshless methods (for solid mechanics) based on global weak forms through a simple and well-structured MATLAB code, to illustrate our discourse. The source code is available for download on our website and should help students and researchers get started with some of the basic meshless methods; it includes intrinsic and extrinsic enrichment, point collocation methods, several boundary condition enforcement schemes and corresponding test cases. Several one and two-dimensional examples in elastostatics are given including weak and strong discontinuities and testing different ways of enforcing essential boundary conditions.

Adaptive Random Testing (ART) is a method for improving the fault-finding effectiveness of random testing. Fixed-Size Candidate Set ART is the most studied variant of this approach. However, existing implementations of FSCS-ART have had substantial selection overhead, with n test cases requiring O n 2 time to generate. We describe the use of a geometric data structure known as the Voronoi Diagram to reduce this overhead to no worse than O(n √ n) and, with further optimization, O(n log n). We demonstrate experimentally that practical improvements in selection overhead can be gained using this improved implementation.

This paper presents a test-case generator for SQL queries. Starting with a set of related SQL views that can include existential subqueries in the conditions, the technique finds a database instance that can be used as a test-case for the target view. The proposal reduces the problem of generating the test-cases to a Constraint Satisfaction Problem using finite domain constraints. In particular, we present a new approach for existential conditions that makes possible to find test-cases for a wider set of queries. The soundness and correctness of the technique with respect to a simple operational semantics for SQL queries without aggregates is proven. The theoretical ideas have been implemented in an available prototype.

Test case prioritization techniques basically schedule the execution of test cases in a definite order such that to attain an objective function with greater efficiency. This scheduling of test cases improves the results of regression testing. Test case prioritization techniques order the test cases such that the most important ones are executed first encountering the faults first and thus makes the testing effective. In this paper an approach is presented which calculates the product of statement coverage and function calls. The results illustrate the effectiveness of formula computed with the help of APFD metric.

This dissertation introduces a novel validation method for knowledge-based systems (KBS). Validation is an essential phase in the development lifecycle of knowledge-based systems. Validation ensures that the system is valid, reliable and that it reflects the knowledge of the expert and meets the specifications. Although many validation methods have been introduced for knowledge-based systems, there is still a need for an incremental validation method based on a lifecycle model. Lifecycle models provide a general framework for the developer and a mapping technique from the system into the validation process. They support reusability, modularity and offer guidelines for knowledge engineers to achieve high quality systems. CommonKADS is a set of models that helps to represent and analyze knowledge-based systems. It offers a de facto standard for building knowledge-based systems. Additionally, CommonKADS is a knowledge representation-independent model. It has powerful models that can represent many domains. Defining an incremental validation method based on a conceptual lifecycle model (such as CommonKADS) has a number of advantages such as reducing time and effort, ease of implementation when having a template to follow, well-structured design, and better tracking of errors when they occur. Moreover, the validation method introduced in this dissertation is based on case testing and selecting an appropriate set of test cases to validate the system. The validation method defined makes use of results of prior test cases in an incremental validation procedure. This facilitates defining a minimal set of test cases that provides complete and effective system coverage. CommonKADS doesn't define validation, verification or testing in any of its models. This research seeks to establish a direct relation between validation and lifecycle models, and introduces a validation method for KBS embedded into CommonKADS.

This paper presents some adaptive restart randomized greedy heuristics for MAXIMUM CLIQUE. The algorithms are based on improvements and variations of previously-studied algorithms by the authors. Three kinds of adaptation are studied: adaptation of the initial state (AI) given to the greedy heuristic, adaptation of vertex weights (AW) on the graph, and no adaptation (NA). Two kinds of initialization of

In recent years Digital TV receivers (DTV) and Set-Top Boxes (STB) have been advancing in terms of new functionalities they offer to the end-users. This has mainly been triggered by the appearance of new multimedia formats and applications needed to be adequately handled by the DTV/STB. In such complex system within the environment consisting of wide range of non-interactive as well as interactive applications and services for television, internet, gamming, healthcare, surveillance, etc., efficient and reliable DTV functional verification becomes highly necessary and challenging task. Since efficient DTV testing is considered as one of the most important issues for the reduced time-to-market, its optimization is of crucial importance to the DTV manufacturing process. Having in mind the end-users as the main target of the DTV, optimal test generation process must also include estimated usage-profiles in addition to the pre-defined DTV designed specification. This is especially important considering new emerging multimedia technologies for DTV which are not yet fully standardized and evaluated, and which exact employment (from the point of end-users) is not known in advance. In this paper we propose a novel approach for user driven test-case generation that would enable adequate and efficient testing of the DTV/STB in different development stages before reaching the market, i.e., the end-users. The proposed user driven approach provides optimal test-case generation in terms of both test execution time and adequacy according to the real end-user DTV functional DTV operation and quality of experience (QoE). This is obtained by incorporating a novel design and selection scheme for test-cases generation based on the modeled end-users most required functional operations on the DTV/STB under test and its expectations of it 1 .

The correctness of compilers is instrumental in the safety and reliability of other software systems, as bugs in compilers can produce programs that do not reflect the intents of programmers. Compilers are complex software systems due to the complexity of optimization. GCC is an optimizing C compiler that has been used in building operating systems and many other system software. In this paper, we describe K-CONFIG, an approach that uses the bugs reported in the GCC repository to generate new test inputs. Our main insight is that the features appearing in the bug reports are likely to reappear in the future bugs, as the bugfixes can be incomplete or those features may be inherently challenging to implement hence more prone to errors. Our approach first clusters the failing test input extracted from the bug reports into clusters of similar test inputs. It then uses these clusters to create configurations for Csmith, the most popular test generator for C compilers. In our experiments on two versions of GCC, our approach could trigger up to 36 miscompilation failures, and 179 crashes, while Csmith with the default configuration did not trigger any failures. This work signifies the benefits of analyzing and using the reported bugs in the generation of new test inputs.

The target of software engineering is to produce high quality software product at low cost. Software testing is labour-intensive, ambiguous and error prone activity of software development. How to provide cost-effective strategies for software test cases optimization problem such as classification, minimization, selection, and prioritization has been one of the research focuses in software testing for a long time. Many researchers and academicians have addressed the effectiveness/fitness and optimization of test cases, and obtained many interesting results. However, one issue of paramount importance in software testing i.e.

In recent years Digital TV receivers (DTV) and Set-Top Boxes (STB) have been advancing in terms of new functionalities they offer to the end-users. This has mainly been triggered by the appearance of new multimedia formats and applications needed to be adequately handled by the DTV/STB. In such complex system within the environment consisting of wide range of non-interactive as well as interactive applications and services for television, internet, gamming, healthcare, surveillance, etc., efficient and reliable DTV functional verification becomes highly necessary and challenging task. Since efficient DTV testing is considered as one of the most important issues for the reduced time-to-market, its optimization is of crucial importance to the DTV manufacturing process. Having in mind the end-users as the main target of the DTV, optimal test generation process must also include estimated usage-profiles in addition to the pre-defined DTV designed specification. This is especially important considering new emerging multimedia technologies for DTV which are not yet fully standardized and evaluated, and which exact employment (from the point of end-users) is not known in advance. In this paper we propose a novel approach for user driven test-case generation that would enable adequate and efficient testing of the DTV/STB in different development stages before reaching the market, i.e., the end-users. The proposed user driven approach provides optimal test-case generation in terms of both test execution time and adequacy according to the real end-user DTV functional DTV operation and quality of experience (QoE). This is obtained by incorporating a novel design and selection scheme for test-cases generation based on the modeled end-users most required functional operations on the DTV/STB under test and its expectations of it 1 . , Turkey in 2010. His fields of interest are circuit theory, microcontroller/microprocessor based system design, digital video systems and DSP applications.

BACK TO BASIC: GENERATING TEST CASES FROM SOURCE CODES Rosziati Ibrahim Tiu Kian Yong Universiti Tun Hussein Onn Malaysia (UTHM) ABSTRACT Through the years, the complexity and the size of a system are growing. Thus, to perform a testing with manual creation of test cases is very time consuming. This is because developer or tester will need to manually look into the source codes, line by line, to define the test cases. Moreover, manual creation of test cases does not increase reliability of testing the source codes. ...

The smart cards are increasingly used in several fields with critical data that require security. We cite, as example, the medical field and payment shopping with smart card. Therefore, the hardware and software security of smart cards is one of the key elements of the security of sensitive information handled. Currently, several scientific researchers are interested in studying and enhancing the smart cards security. The study of vulnerabilities is a prerequisite for building security guarantees of this type of devices. Indeed, each vulnerability can easily lead to an attack. In this paper, we generate vulnerability test cases based on models of Europay-MasterCard and Visa (EMV) specifications. We used SysML language to model the EMV transaction through machine state diagram. Then, we generated Event-B model that we exploit it to generate vulnerability and robustness test cases. This work aims to ensure the safety of EMV cards against attacks exploiting the vulnerability of the system.

Spreadsheet languages are widely used by a variety of end users to perform many important tasks. Despite their perceived simplicity, spreadsheets often contain faults. Furthermore, users modify their spreadsheets frequently, which can render previously correct spreadsheets faulty. To address this problem, we previously introduced a visual approach by which users can systematically test their spreadsheets, see where new tests are required after changes, and request automated generation of potentially useful test inputs. To date, however, this approach has not taken advantage of previously developed test cases, which means that users of the approach cannot benefit, when re-testing following changes, from prior testing efforts. We have therefore been investigating ways to add support for test re-use into our spreadsheet testing methodology. In this paper we present a test re-use strategy for spreadsheets, and the algorithms that implement it, and describe their integration into our spreadsheet testing methodology. We report results of a case study examining the application of this strategy.

The aim of this manuscript is to give a practical overview of meshless methods (for solid mechanics) based on global weak forms through a simple and well-structured MATLAB code, to illustrate our discourse. The source code is available for download on our website and should help students and researchers get started with some of the basic meshless methods; it includes intrinsic and extrinsic enrichment, point collocation methods, several boundary condition enforcement schemes and corresponding test cases. Several one and two-dimensional examples in elastostatics are given including weak and strong discontinuities and testing different ways of enforcing essential boundary conditions.

Test case prioritization techniques basically schedule the execution of test cases in a definite order such that to attain an objective function with greater efficiency. This scheduling of test cases improves the results of regression testing. Test case prioritization techniques order the test cases such that the most important ones are executed first encountering the faults first and thus makes the testing effective. In this paper an approach is presented which calculates the product of statement coverage and function calls. The results illustrate the effectiveness of formula computed with the help of APFD metric.

The paper contains a case study demonstrating a complete process for specification based class testing. The process starts with an abstract specification written in Object-Z and concludes by exercising an implementation with test cases and evaluating the results. The test cases are derived using the Test Template Framework for each individual operation. They are analysed to generate a finite state machine that can execute test sequences within the ClassBench framework. An oracle is also derived from the Object-Z specification. The case study demonstrates how a formal specification contributes to the development of practical tests that can be executed by a testing tool. It also shows how a test oracle can be derived from a specification and used by the same testing tool to evaluate test results

Test case prioritization techniques basically schedule the execution of test cases in a definite order such that to attain an objective function with greater efficiency. This scheduling of test cases improves the results of regression testing. Test case prioritization techniques order the test cases such that the most important ones are executed first encountering the faults first and thus makes the testing effective. In this paper an
approach is presented which calculates the product of statement coverage and function calls. The results
illustrate the effectiveness of formula computed with the help of APFD metric.

The addition of support for genericity to mainstream programming languages has a notable influence in refactoring tools. This also applies to the JAVA programming language. Those versions of the language specification prior to JAVA 5 did not include support for generics. Therefore, refactoring tools had to evolve to modify their refactoring implementations according to the new language characteristics in order to assure the correct effects when transforming code containing generic definitions or using generic instantiations. This paper presents an evaluation of the behaviour of refactoring tools on source code that defines or uses generics. We compare the behaviour of five refactoring tools on a well known refactoring, Extract Method, and its implementation for the JAVA language. We distill the lessons learned from our evaluation into requirements that have to be taken into account by refactoring tools in order to fully conform to this new language feature.

Discovering and fixing software bugs is a difficult maintenance task, and a considerable amount of effort is devoted by software developers on this issue. In the world of software one cannot get rid of the bugs, fixes, patches etc. each of them have a severity and priority associated to it. There is not yet any formal relation between these components

We show how two novel tools in logic programming for AI (namely, continuation-based linear and timeless assumptions, and Datalog grammars) can assist us in producing terse treatments of difficult language processing phenomena. As a proof of concept, we present a concise parser for Datalog grammars (logic grammars where strings are represented with numbered word boundaries rather than as lists of words) that uses assumptions and a combination of left-corner parsing and charting. We then study two test cases of this parser's application: complete constituent coordination, and error diagnosis and correction.

Functional validation of modern microprocessors is an important and complex problem. One of the problems in functional validation is the generation of test cases that has higher potential to find faults in the design. We propose a model based test generation framework that generates tests for design fault classes inspired from software validation. There are two main contributions in this paper. Firstly, we propose a microprocessor modeling and test generation framework that generates test suites to satisfy Modified Condition Decision Coverage (MCDC), a structural coverage metric that detects most of the classified design faults as well as the remaining faults not covered by MCDC. Secondly, we show that there exists good correlation between types of design faults proposed by software validation and the errors/bugs reported in case studies on microprocessor validation. We demonstrate the framework by modeling and generating tests for the microarchitecture of VESPA, a 32-bit microprocessor. In the results section, we show that the tests generated using our framework's coverage directed approach detects the fault classes with 100% coverage, when compared to model-random test generation.

The test cases are generated manually as well as automatically to test software product. Manual test case generation require more time and cost than automatic test case generation. Automated generated test cases decrease the time and cost of testing process. Nowadays software companies are turning towards automated test case generation. After the generation of test cases, there is need to optimize the generated test cases. For their optimization we will apply artificial intelligence techniques. The genetic algorithm is based on the evolutionary ideas of natural selection and genetics. Genetic Algorithm (GA), a heuristic search algorithm is used for optimization. Here, we will integrate tabu search algorithm with genetic algorithm (GTSA) for optimization the result using an analysis of data.

Software testing is an indispensable part of the software development process. Mutation analysis is regarded as an effective software testing method. By adopting mutation operators on the original program, mutation analysis generates mutants to simulate possible bugs, and then it creates a test case suite working on both mutants and the original program to analyze the difference in the results and find these bugs. Mutation analysis improves the test case suite until it is strong enough to find all possible bugs. If the result of running a mutant is different from the result of running the original program for at least one test case in the input test case suite, the seeded fault denoted by the mutant is detected. However, in the process of seeding into the fault, there is the equivalent mutant that has exactly the same behavior as the original program generated. These equivalent mutants obstruct the precise assessment of the quality of the test case suite. Therefore, it is necessary to remove them. In this article, we improve a previously proposed novel approach to equivalent mutant detection that uses symbolic computation. When we apply symbolic computation to a statement with loop description, the path explosion problem occurs. To overcome this path explosion problem, this article proposes a method that restricts the number of iterations to improve the detection ratio of equivalent mutants.

(dberry AT uwaterloo DOT ca) Khuzaima Daudjee (kdaudjee AT uwaterloo DOT ca) Jing Dong (jdong AT utdallas DOT edu) Igor Fainchtein (igor_finestein AT lgs DOT com) Maria Augusta Nelson (guta AT csg DOT uwaterloo.ca) Torsten Nelson (torsten AT csg DOT uwaterloo DOT ca) Lihua Ou (lizzy_ou AT yahoo DOT com

Software testing provides a medium to reduce the errors and overall cost of the system. Various software testing techniques, methods and tool are available to enhance software quality. This paper provides a short study material on software testing, objectives, principles of software testing. Further It also answer the question raised by people about what are the basic skills are required for software testers that is who wants to make their career in testing. Also deals with the basic things that are kept in mind while doing planning, making test cases. This paper also deals with how to write good test cases this is one of the important factors in testing.

Discovering and fixing software bugs is a difficult maintenance task, and a considerable amount of effort is devoted by software developers on this issue. In the world of software one cannot get rid of the bugs, fixes, patches etc. each of them have a severity and priority associated to it. There is not yet any formal relation between these components

We show how several novel tools in logic programming for AI (namely, continuation-based linear and timeless assumptions, and datalog grammars) can assist us in producing terse treatments of di@cult language processing phenomena. As a proof of concept, we present a concise parser for datalog grammars (logic grammars where strings are represented with numbered word boundaries rather than as lists of words) that uses assumptions and a combination of lef-comer parsing and charting. We then study two test cases of this parser's application: complete constituent coordination, and error diagnosis and correction.

The target of software engineering is to produce high quality software product at low cost. Software testing is labour-intensive, ambiguous and error prone activity of software development. How to provide cost-effective strategies for software test cases optimization problem such as classification, minimization, selection, and prioritization has been one of the research focuses in software testing for a long time. Many researchers and academicians have addressed the effectiveness/fitness and optimization of test cases, and obtained many interesting results. However, one issue of paramount importance in software testing i.e.

The aim of this manuscript is to give a practical overview of meshless methods (for solid mechanics) based on global weak forms through a simple and well-structured MATLAB code, to illustrate our discourse. The source code is available for download on our website and should help students and researchers get started with some of the basic meshless methods; it includes intrinsic and extrinsic enrichment, point collocation methods, several boundary condition enforcement schemes and corresponding test cases. Several one and two-dimensional examples in elastostatics are given including weak and strong discontinuities and testing different ways of enforcing essential boundary conditions.

Software testing is a process continuously performed by the development team during the life cycle of the software with the motive to detect the faults as early as possible. Regressing testing is the most suitable technique for this in which we test number of test cases. As the number of test cases can be very large it is always preferable to prioritize test cases based upon certain criterions.In this paper prioritization strategy is proposed which prioritize test cases based on requirements analysis. By regressing testing if the requirements will vary in future, the software will be modified in such a manner that it will not affect the remaining parts of the software. The proposed system improves the testing process and its efficiency to achieve goals regarding quality, cost, and effort as well user satisfaction and the result of the proposed method evaluated with the help of performance evaluation metric.