Wyniki wyszukiwania - Biblioteka Nauki

1

Mutation Churn Model

100%

Mnich M. , Roman A. , Wawrzyniak P.

|

tom Vol. 25

227--236

EN

Mutation testing is considered as one of the most effective quality improvement technique by assessing the strength of the actual test suite. If no test is able to kill a given mutant, this means that the tests are not strong enough and we need to write additional one that will be able to kill this mutant. However, mutation testing is very time consuming. In this paper we investigate if it is possible to reduce the scope of the mutation analysis by running it only on the new or changed part of the code. Using data from the real open-source projects we analyze if there is a relation between mutation scope reduction and effectiveness of the mutation analysis.

2

Early estimating the number of errors encountered during program testing

80%

Konopacki J. , Worwa K.

Biuletyn Instytutu Systemów Informatycznych

|

2009

|

tom nr 3

53-57

EN

An approach to estimate the number of errors encountered during the program testing process is proposed in the paper. Considerations are based on some program reliability growth model which is constructed for assumed scheme of program testing process. In this model the program under the testing is characterized by means of so-called characteristic matrix and the program testing process is determined by means of so-called testing strategy. The formula for determining the mean value of the predicted number of errors encountered during the program testing is obtained. This formula can be used if the characteristic matrix and the testing strategy are known. Formula for estimating this value when the program characteristic matrix is not known are also proposed in the paper.

3

A Testing Environment for Distributed Systems

80%

Sztandarski M. , Sowa G. , Goetzen P. , Marchlewska A.

Journal of Applied Computer Science Methods

|

2012

|

tom Vol. 4 No. 1

45--62

EN

The article presents the basics of modern software testing theory. Testing automation and the integration of testing into code writing will be examined in detail, and concept of a testing environment for distributed systems will be introduced.

4

Mobile Software Testing Hardware – Stateofthe-Art

80%

Kawalerowicz M.

Zeszyty Naukowe. Elektryka / Politechnika Opolska

|

2013

|

tom z. 69

37--40

EN

This article provides short state-of-the-art review over the robotic mobile software testing devices. It presents all devices that are known to the author (one of which is built by the author) in comparison to each other.

5

Process of finding defects in software testing

80%

Rana A. , Rawa A. S. , Bijalwan A.

Annals of Computer Science and Information Systems

|

2017

|

tom Vol. 10

297--300

EN

Software testing is the most significant stage of the Software Development Life Cycle. Projects underneath testing goes through different stages such as test analysis, test planning, test case, test case review process, test execution process, requirement traceability matrix (RTM), defect tracking (bug logging and tracking), test execution report and closure. In terms of software, defects means whenever expected results not meet actual results. Generally defect is known as a bug. It talks about the complete life cycle of a bug right from the stage it was found, fixed, re-test, and close.This paper basically deals with entire process of bug life cycle and how to avoid the bug. To avoid the bug, Test Engineer should prepare the bug report template which consists of various steps.

6

MODELING THE SOFTWARE TESTING PROCESS TAKING INTO ACCOUNT THE SECONDARY ERRORS

80%

Konopacki G.

|

2016

|

tom 5

|

nr 2

175-184

EN

It discusses the two formal models of software testing by the concept of a black box. In the first model assumes a non-zero probability of not removing the detected error. In the second model assumes also non-zero probability to introduce additional of error, so-called secondary error. In both cases the systems of Chapman-Kolmogorov differential equations was formulated. Solving them was obtained formulas to enable an estimate the expected number of errors remaining in the software after end of testing and estimation of the expected duration of the process to complete software testing them.

7

Knowledge Management in Software Testing: A Systematic Snowball Literature Review

80%

Wnuk K. , Garrepalli T.

e-Informatica Software Engineering Journal

|

2018

|

tom Vol. 12, nr 1

51--78

EN

Description : Software testing benefits from the usage of Knowledge Management (KM) methods and principles. Thus, there is a need to adopt KM to the software testing core processes and attain the benefits that it provides in terms of cost, quality, etc. Aim : To investigate the usage and implementation of KM for software testing. The major objectives include 1. To identify various software testing aspects that receive more attention while applying KM. 2. To analyse multiple software testing techniques, i.e. test design, test execution and test result analysis and highlight KM involvement in these. 3. To gather challenges faced by industry due to the lack of KM initiatives in software testing. Method : A Systematic Literature Review (SLR) was conducted utilizing the guidelines for snowballing reviews by Wohlin. The identified studies were analysed in relation to their rigor and relevance to assess the quality of the results. Results : The initial resulting set provided 4832 studies. From these, 35 peer-reviewed papers were chosen among which 31 are primary, and 4 are secondary studies. The literature review results indicated nine testing aspects being in focus when applying KM within various adaptation contexts and some benefits from KM application. Several challenges were identified, e.g., improper selection and application of better-suited techniques, a low reuse rate of software testing knowledge, barriers in software testing knowledge transfer, no possibility to quickly achieve the most optimum distribution of human resources during testing, etc. Conclusions : The study brings supporting evidence that the application of KM in software testing is necessary, e.g., to increase test effectiveness, select and apply testing techniques. The study outlines the testing aspects and testing techniques that benefit their users.

8

Modeling the software testing process taking into account the secondary errors

80%

Konopacki G.

Information Systems in Management

|

2016

|

tom Vol. 5, No. 2

175--184

EN

It discusses the two formal models of software testing by the concept of a black box. In the first model assumes a non-zero probability of not removing the detected error. In the second model assumes also non-zero probability to introduce additional of error, so-called secondary error. In both cases the systems of ChapmanKolmogorov differential equations was formulated. Solving them was obtained formulas to enable an estimate the expected number of errors remaining in the software after end of testing and estimation of the expected duration of the process to complete software testing them.

9

Software test management approach for agile environments

80%

Pawlak M. , Poniszewska-Marańda A.

Information Systems in Management

|

2018

|

tom Vol. 7, No. 1

47--58

EN

Software testing is a very broad term that includes a wide variety of topics. They range from technical like testing techniques and measurements, to more organizational like planning and management of testing. Ability to plan, design and create efficient tests is the most critical ability for any good tester. The paper presents Kungfu Testing, which is a testing approach based on advice and best practices advocated by experts in the field of testing. The method is intended to provide a step-by-step instruction of managing testing activities in a project environment. The presented approach was designed to work with and complement the agile development methodologies due to their widespread use and popularity.

10

Parallel Mutant Execution Techniques in Mutation Testing Process for Simulink Models

80%

Hanh L. T. M. , Binh N. T. , Tung K. T.

Journal of Telecommunications and Information Technology

|

2017

|

tom nr 4

90--100

EN

Mutation testing – a fault-based technique for software testing – is a computationally expensive approach. One of the powerful methods to improve the performance of mutation without reducing effectiveness is to employ parallel processing, where mutants and tests are executed in parallel. This approach reduces the total time needed to accomplish the mutation analysis. This paper proposes three strategies for parallel execution of mutants on multicore machines using the Parallel Computing Toolbox (PCT) with the Matlab Distributed Computing Server. It aims to demonstrate that the computationally intensive software testing schemes, such as mutation, can be facilitated by using parallel processing. The experiments were carried out on eight different Simulink models. The results represented the efficiency of the proposed approaches in terms of execution time during the testing process.

11

A discrete-time software reliability-growth model and its application for predicting the number of errors encountered during program testing

70%

Worwa K.

Control and Cybernetics

|

2005

|

tom Vol. 34, no 2

589-606

EN

An approach to evaluate the number of errors encountered during the program testing process is proposed in the paper. Considerations are based on some program reliability-growth model, constructed for an assumed scheme of the program testing process. In this model the program under testing is characterized by means of the so-called characteristic matrix and the program testing process is determined by means of so-called testing strategy. The formula for determining the mean value of the predicted number of errors encountered during the program testing is obtained. This formula can be used if the characteristic matrix and the testing strategy are known. Formulae for evaluating this value when the program characteristic matrix is not known are also proposed.

12

Systematic Literature Review on Search Based Mutation Testing

70%

Nishtha J. , Bharti S. , Shweta R.

e-Informatica Software Engineering Journal

|

2017

|

tom Vol. 11, nr 1

59--76

EN

Search based techniques have been widely applied in the domain of software testing. This Systematic Literature Review aims to present the research carried out in the field of search based approaches applied particularly to mutation testing. During the course of literature review, renowned databases were searched for the relevant publications in the field to include relevant studies up to the year 2014. Few studies for the year 2015-16, gathered by performing snowball search, have also been included. For reviewing the literature in the field, 43 studies were evaluated, out of which 18 studies were thoroughly studied and analysed. The result of this SLR shows that search based techniques were applied to mutation testing primarily for two purposes, either for mutant optimisation or for test case optimisation. The future directions of this SLR suggests the application of search based techniques for other issues related to mutation testing, like, solution to equivalents mutants, generation of non-trivial mutants, multi-objective test data generation and non-functional testing.

13

Modelling the software testing process

60%

Worwa K.

Studia Bezpieczeństwa Narodowego

|

2014

|

tom R. 4, Nr 6

359--375

EN

An approach to formal modelling the program testing process is proposed in the paper. Considerations are based on some program reliability-growth model that is constructed for assumed scheme of the program testing process. In this model the program under the testing is characterized by means of so-called characteristic matrix and the program testing process is determined by means of so-called testing strategy. The formula for determining the mean value of the predicted number of errors encountered during the program testing is obtained. This formula can be used if the characteristic matrix and the testing strategy are known. Formulae for evaluating this value when the program characteristic matrix is not known are also proposed in the paper.

PL

Przedmiotem zawartych w artykule rozważań jest modelowanie procesu testowania programu, ze szczególnym uwzględnieniem modelowania wzrostu niezawodności programu w procesie jego testowania. W rozpatrywanym modelu testowany program charakteryzowany jest za pomocą tzw. macierzy charakterystycznej programu. Na bazie skonstruowanego modelu wyprowadzona została zależność na wartość oczekiwaną liczby błędów, wykrycie których spodziewane jest w wyniku realizacji procesu testowania, realizowanego w oparciu o przyjętą strategię testowania. Otrzymana zależność może być wykorzystana w praktyce, jeżeli macierz charakterystyczna programu jest znana. Dla przypadku, gdy macierz ta nie jest znana skonstruowane zostało w artykule obustronne oszacowanie tej wartości oczekiwanej.

14

Model formalny dla problemu lokalizacji błędów w kodzie programu

60%

Dereniowski D. , Kubale M.

|

2007

|

tom T. 11, z. 1-2

81-88

PL

Istnieje szereg sposobów badania poprawności programów komputerowych. W artykule podejmujemy problem automatycznego testowania oprogramowania przy założeniu, że dany jest zbiór testów (asercji) dla poszczególnych fragmentów kodu. Dla uproszczenia analizy zakładamy, że badany fragment kodu zawiera dokładnie jeden błąd, co nie zmniejsza ogólności rozważań. W artykule analizujemy praktyczne aspekty powyższego problemu oraz rozważamy model teoretyczny oparty na teorii grafów, w szczególności jej chromatyczne aspekty oraz pewien model przeszukiwania grafu opisującego strukturę programu.

EN

There are several criteria for testing program correctness. In this paper we deal with the problem of automatic software testing under the assumption that the set of tests (assertions) is given for selected blocks of code. We simplify the analysis by assuming that the program being tested contains exactly one bug, but this does not lead to loss of generality. We consider some practical aspects of the above problem and a graph-theoretical model in general as well as some chromatic aspects of a graph searching model in particular.

15

Control flow graphs and code coverage

60%

Gold R.

|

tom 20

|

nr 4

739-749

EN

The control flow of programs can be represented by directed graphs. In this paper we provide a uniform and detailed formal basis for control flow graphs combining known definitions and results with new aspects. Two graph reductions are defined using only syntactical information about the graphs, but no semantical information about the represented programs. We prove some properties of reduced graphs and also about the paths in reduced graphs. Based on graphs, we define statement coverage and branch coverage such that coverage notions correspond to node coverage, and edge coverage, respectively.

16

Improved method of testing distributed system interfaces using simulation tests

60%

Mukhin V. , Kornaga Y. , Bazaka Y. , Barabash A. , Mukhin O.

|

tom Vol. 25, No 2

261--270

EN

In this paper a modification of Mike Cohn's test pyramid is described for adaptation during testing in distributed information processing systems which allows expanding the possibilities of testing and applying the features of such systems. Recommendations for further use of the mechanisms of modified Mike Cohn's pyramid are developed. The method of testing the user interface software of the nodes of a distributed system was improved to differ from the existing techniques by including a mechanism of simulation of its operation to allow testing of individual components of the system interface. It is shown that in comparison with end-to-end testing of user interfaces the advantages of using the mechanisms of user interface test simulators allow reducing the time spent on testing any UI service. The time is reduced by decreasing the number of simultaneous user interface services. With a small number of nodes, end-to-end testing of user interfaces is faster than simulation testing of the same user interfaces. As the number of nodes increases, the time required to test the services of a distributed system by simulation tests becomes shorter than the time required to test the same system by a traditional method.

17

Comparison Study of Test Case Allocation Schemes in Software Partition Testing

60%

Worwa K. , Stanik J.

Biuletyn Instytutu Systemów Informatycznych

|

2011

|

tom nr 8

59-66

EN

The partition testing method is a commonly followed practice towards the selection of test cases. For partition testing, the program's input domain is divided into subsets, called subdomains, and one or more representatives from each subdomain are selected to test the program. The goal of such partitioning is to make the division of the program's input domain in such a way that when the tester selects test cases based on the subsets, the resulting test set is a good representation of the entire domain. The main aim of the paper is to analyse the fault-detecting ability of the partition testing method. Using effectiveness metrics for testing and partitioning schemes this paper makes a comparison of various test case allocation schemes in partition testing.

PL

W artykule przedstawione są wyniki porównania dwóch, najczęściej wykorzystywanych w praktyce, strategii losowego tworzenia zbioru danych testowych. Pierwsza z tych strategii, nazywana testowaniem w pełni losowym, polega na losowaniu poszczególnych przypadków testowych ze zbioru wszystkich możliwych zestawów danych wejściowych rozpatrywanego programu, przy czym najczęściej przyjmuje się tutaj, że wylosowanie każdego z tych zestawów jest jednakowo prawdopodobne. Druga z analizowanych strategii zakłada podział całego zbioru wszystkich możliwych zestawów danych wejściowych programu na tzw. partycje, będące podzbiorami, tworzonymi w oparciu o kryteria wykorzystywane w testowaniu strukturalnym. Strategia ta jest nazywana strukturalnym testowaniem losowym. Zawarte w artykule rozważania mają na celu określenie warunków, dla których jedna z ww. strategii testowania losowego jest lepsza od drugiej, w sensie prawdopodobieństwa wykrycia co najmniej jednego błędu.

18

Testing geodetic software

60%

Bednarczyk M.

|

tom 08

|

nr 2

EN

Software quality depends primarily on a properly planned and correctly carried out development process. Testing, which has an enormous influence on the whole project, is one phase of this process. This is the last step of production and includes system implementation as well. Specialist software, which without a doubt geodetic applications are, requires special attention to work quality. It should be ensured already at the design phase, when individual functions are created according to requirements specification. But often the product can not be properly evaluated before the end of the production process. Some deficiencies and shortcomings (resulting from erroneous coding, incorrect interpretation of user requirements or design flaws) become apparent only after the end of the production process. The only way to minimize the number of these errors is the participation of geodesy experts in the testing phase. They can support their knowledge and experience with specialist software, which allows to shorten the time and decrease the cost of this time-consuming process.

19

Liczba przypadków testowych w procesie testowania funkcjonalnego wirtualnych przyrządów pomiarowych

60%

Florczyk M.

Pomiary Automatyka Kontrola

|

2008

|

tom R. 54, nr 6

380-382

PL

W artykule została przedstawiona metoda wyznaczania liczby testów na podstawie znajomości liczby elementów interfejsu użytkownika przyrządu wirtualnego. Powiązano liczbę przypadków testowych z ogólną liczbą przeprowadzonych testów, gdy testy przeprowadzane są dla kombinacji elementów interfejsu użytkownika przyrządu wirtualnego. Przedstawiono też sposób określania czasu przeprowadzenia testów na podstawie znajomości liczby przypadków testowych.

EN

In his paper presented is the method of test cases calculation on the basis of number of user interface elements of virtual instrument. The number of test cases was related to overall number of carried out tests, when the test are carried out for combination of user interface elements. The manner of determining time for the tests was presented. That was done on the basis of knowledge of number of test cases.

20

Generating placated random shapes for an area estimation study

51%

Almowanes A. , Kakiashvili T. , Koczkodaj W. W.

Journal of Applied Mathematics and Computational Mechanics

|

2013

|

tom Vol. 12, nr 2

5--13

EN

Random but visually nice shapes are often needed for cognitive experiments and processes. This study describes a heuristic for generating random but nice shapes. We call them placated shapes. These shapes are produced by applying the Gaussian blur to randomly generated polygons. Subsequently, the threshold is set to transform pixels to black and white from different shades of gray. This transformation produces placated shapes for easier estimation of areas. Randomly generated placated shapes are used for testing the accuracy of cognitive processes by pairwise comparisons. They can also be used in many other areas such as computer games or software testing. Such shapes could also be used for camouflaging heavy army equipment.