Search

The types of the testing methods were analyzed from the side of development. If changes are made to the code, even minor ones, bugs can appear anywhere in the system. The cost of fixing bugs increases with the time they are discovered. Using effective web testing can prevent unexpected costs. Modern web applications are indeed a place where all the type of the testing is vital for the high-quality product. At the moment, traditional front and back office applications are increasingly moving from desktop computers to web interfaces, so testing web applications is becoming extremely relevant. Thus, learning what to automate and how is an important component of successful web application testing. Web application testing is a software practice that is designed to ensure quality by verifying that the functionality of a particular web application works correctly or according to fixed requirements. Web testing makes it possible to find bugs at any point in time, before release or on a daily basis. On the one hand there are wide range of tools that could be used to pursue this goal by means of using best decisions present for now but on the other hand there are essential advantages and disadvantages present in these tools, which are all in the approach to it, so there are always cons and pros of using one or another. For now, despite on having the ability to test using both black and white box testing it looks like the second one is not the best choice. There are several points on each board for both of them, but black box approach that is being represented with react testing library is more successful and efficient way to cover and application with high- and low-level tests, that could be easily maintained and understood. But white box testing is now the most used decision due to the historic development of the industry. So, it also has some great features and could be chosen to be used on the project, but it should be precise choice with the understanding of all the consequences standing behind.

Nowadays, the whole driver monitoring system can be placed inside the vehicle driver's smartphone, which introduces new security and privacy risks to the system. Because of the nature of the modern transportation systems, the consequences of the security issues in such systems can be crucial, leading to threat to human life and health. Moreover, despite the large number of security and privacy issues discovered in smartphone applications on a daily basis, there is no general approach for their automated analysis that can work in conditions that lack data and take into account specifics of the application area. Thus, this paper describes an original approach for a security and privacy analysis of driver monitoring systems based on smartphone sensors. This analysis uses white-box testing principles and aims to help developers evaluate and improve their products. The novelty of the proposed approach lies in combining various security and privacy analysis algorithms into a single automated approach for a specific area of application. Moreover, the suggested approach is modular and extensible, takes into account specific features of smartphone-based driver monitoring systems and works in conditions of lack or inaccessibility of data. The practical significance of the approach lies in the suggestions that are provided based on the conducted analysis. Those suggestions contain detected security and privacy issues and ways of their mitigation, together with limitations of the analysis due to the absence of data. It is assumed that such an approach would help developers take into account important aspects of security and privacy, thus reducing related issues in the developed products. An experimental evaluation of the approach is conducted on a car driver monitoring use case. In addition, the advantages and disadvantages of the proposed approach as well as future work directions are indicated. [ABSTRACT FROM AUTHOR]

In order to meet the ever-increasing needs of health care, as well as helping patients who need continuous care after being discharged from the hospital and making modern medical technology better serve humans, the design of electronic medical records for continuous care patients, especially those with malignant tumors, is investigated. In the research process, the idea of Browser/Server (B/S) framework is adopted, and the corresponding electronic medical record system is designed based on the targets and the overall structure of the system; afterward, the black-box testing and white-box testing are carried out to test the functions, reliability, and stability of the designed electronic medical record system; in addition, combined with other research results, the feasibility of the design is proved. It can be seen that the electronic medical record system designed for patients who need continuous care in the study is absolutely feasible, which can be further researched and improved with the development of electronic medical records; therefore, it would make greater contributions to both patients and hospitals in the future.

In the past decades, a significant increase has been observed in cyberattacks on the web-based systems used for financial purposes. Such individual systems often contain security weaknesses, called vulnerabilities that can be exploited for malicious purposes. The exploitation of such vulnerabilities can result in disclosure and manipulation of sensitive data as well as have destructive effects. To protect such systems, security testing is required on a periodic basis. Various detection and assessment techniques have been suggested by developers and researchers to address these security issues. In this paper, we survey the contributions of academia in the field of security testing for software applications and communication systems. A comprehensive review and in-depth analysis of the existing literature testing approaches has been performed to analyze their effectiveness and applicability under various scenarios. Further, we discuss various techniques used for conducting various security assessments. We follow the widely used method by Kitchenham and Charters for conducting a comprehensive systematic literature review process. Also, we propose a taxonomy for security testing techniques consisting of three main categories (Identification, Testing, and Reporting) and 17 subcategories consisting of specific security testing techniques (e.g., Black-box testing, risk assessment). Further, we assign a distinctive category from our taxonomy to each published paper in the security testing area, based on the material presented/discussed in the paper. [ABSTRACT FROM AUTHOR]

Nowadays, the whole driver monitoring system can be placed inside the vehicle driver’s smartphone, which introduces new security and privacy risks to the system. Because of the nature of the modern transportation systems, the consequences of the security issues in such systems can be crucial, leading to threat to human life and health. Moreover, despite the large number of security and privacy issues discovered in smartphone applications on a daily basis, there is no general approach for their automated analysis that can work in conditions that lack data and take into account specifics of the application area. Thus, this paper describes an original approach for a security and privacy analysis of driver monitoring systems based on smartphone sensors. This analysis uses white-box testing principles and aims to help developers evaluate and improve their products. The novelty of the proposed approach lies in combining various security and privacy analysis algorithms into a single automated approach for a specific area of application. Moreover, the suggested approach is modular and extensible, takes into account specific features of smartphone-based driver monitoring systems and works in conditions of lack or inaccessibility of data. The practical significance of the approach lies in the suggestions that are provided based on the conducted analysis. Those suggestions contain detected security and privacy issues and ways of their mitigation, together with limitations of the analysis due to the absence of data. It is assumed that such an approach would help developers take into account important aspects of security and privacy, thus reducing related issues in the developed products. An experimental evaluation of the approach is conducted on a car driver monitoring use case. In addition, the advantages and disadvantages of the proposed approach as well as future work directions are indicated.

In order to meet the ever-increasing needs of health care, as well as helping patients who need continuous care after being discharged from the hospital and making modern medical technology better serve humans, the design of electronic medical records for continuous care patients, especially those with malignant tumors, is investigated. In the research process, the idea of Browser/Server (B/S) framework is adopted, and the corresponding electronic medical record system is designed based on the targets and the overall structure of the system; afterward, the black-box testing and white-box testing are carried out to test the functions, reliability, and stability of the designed electronic medical record system; in addition, combined with other research results, the feasibility of the design is proved. It can be seen that the electronic medical record system designed for patients who need continuous care in the study is absolutely feasible, which can be further researched and improved with the development of electronic medical records; therefore, it would make greater contributions to both patients and hospitals in the future. [ABSTRACT FROM AUTHOR]

The paper presents a dataset on software tests generated using the Microsoft Pex (IntelliTest) test generator tool for 10 open source projects. The projects were selected randomly from popular GitHub repositories written in C#. The selected projects contain 7187 methods from which Pex was able to generate tests for 2596 methods totaling 38,618 lines of code. Data collection was performed on a cloud virtual machine. The dataset presents metrics about the attributes of the selected projects (e.g., cyclomatic complexity or number of external method calls) and the test generation (e.g., statement and branch coverage, number of warnings). This data is compared to an automated isolation technique in the paper Automated Isolation for White-box Test Generation [1]. To the best of our knowledge, this is the largest public dataset about the test generation performance of Microsoft Pex on open source projects. The dataset highlights current practical challenges and can be used as a baseline for new test generation techniques.

This paper presents an improved mathematical model for calculating the solar test factor (STF) and solar reliability factor (SRF) of a photovoltaic (PV) automated equipment. By employing a unified metrics system and a combined testing suite encompassing various energy-efficient testing techniques, the aim of this paper is to determine a general fault coverage and improve the global SRF of a closed-loop dual-axis solar tracking system. Accelerated testing coupled with reliability analysis are essential tools for assessing the performance of modern solar tracking devices since PV system malfunctioning is directly connected to economic loss, which is an important aspect for the solar energy domain. The experimental results show that the unified metrics system is potentially suitable for assessing the reliability evaluation of many types of solar tracking systems. Additionally, the proposed combined testing platform proves efficient regarding fault coverage (overall coverage of 66.35% for all test scenarios), test time (an average of 275 min for 2864 test cycles), and power consumption (zero costs regarding electricity consumption for all considered test cases) points of view.

Formal ontologies are axiomatizations in a logic-based formalism. The development of formal ontologies is generating considerable research on the use of automated reasoning techniques and tools that help in ontology engineering. One of the main aims is to refine and to improve axiomatizations for enabling automated reasoning tools to efficiently infer reliable information. Defects in the axiomatization cannot only cause wrong inferences, but can also hinder the inference of expected information, either by increasing the computational cost of or even preventing the inference. In this paper, we introduce a novel, fully automatic white-box testing framework for first-order logic (FOL) ontologies. Our methodology is based on the detection of inference-based redundancies in the given axiomatization. The application of the proposed testing method is fully automatic since (i) the automated generation of tests is guided only by the syntax of axioms and (ii) the evaluation of tests is performed by automated theorem provers (ATPs). Our proposal enables the detection of defects and serves to certify the grade of suitability—for reasoning purposes—of every axiom. We formally define the set of tests that are (automatically) generated from any axiom and prove that every test is logically related to redundancies in the axiom from which the test has been generated. We have implemented our method and used this implementation to automatically detect several non-trivial defects that were hidden in various FOL ontologies. Throughout the paper we provide illustrative examples of these defects, explain how they were found and how each proof—given by an ATP—provides useful hints on the nature of each defect. Additionally, by correcting all the detected defects, we have obtained an improved version of one of the tested ontologies: Adimen-SUMO. [ABSTRACT FROM AUTHOR]

Many software testing fields, like white-box testing, test case generation, test prioritization, and fault localization, depend on code coverage measurement. If used as an overall completeness measure, the minor inaccuracies of coverage data reported by a tool do not matter that much; however, in certain situations, they can lead to serious confusion. For example, a code element that is falsely reported as covered can introduce false confidence in the test. This work investigates code coverage measurement issues for the Java programming language. For Java, the prevalent approach to code coverage measurement is using bytecode instrumentation due to its various benefits over source code instrumentation. As we have experienced, bytecode instrumentation-based code coverage tools produce different results than source code instrumentation-based ones in terms of the reported items as covered. We report on an empirical study to compare the code coverage results provided by tools using the different instrumentation types for Java coverage measurement on the method level. In particular, we want to find out how much a bytecode instrumentation approach is inaccurate compared to a source code instrumentation method. The differences are systematically investigated both in quantitative (how much the outputs differ) and in qualitative terms (what the causes for the differences are). In addition, the impact on test prioritization and test suite reduction—a possible application of coverage measurement—is investigated in more detail as well. [ABSTRACT FROM AUTHOR]

This paper proofs three initial hypotheses in relation with the teamwork competence, Firstly, the new university students access to the University without enough knowledge about teamwork competence because they have not been trained or evaluated in this competence. This justifies the use of our Comprehensive Training Model of the Teamwork Competence (CTMTC) method, which allows individualized training and assessment of teamwork competence in all the stages, including the outcome of this teamwork too. Secondly, the realised fieldwork for obtaining indicators that allow evaluate the required effort in order to use CTMTC, focusing on aspects of monitoring (formative evaluation) and outcomes (summative evaluation) and also the enormous effort in time for the teachers to carry it out, are shown. Thirdly, the final evaluation grades obtained by the teams and by their individual members, with the CTMTC method, justify the need of applying that personalized evaluation method and the search of technological tools, such as learning analytics, to help its implementation. [ABSTRACT FROM AUTHOR]

Highlights: [•] Properties inferred from static analysis of the WS-BPEL composition could be limited. [•] We propose extracting properties from actual executions of WS-BPEL compositions. [•] We provide innovative solutions for WS-BPEL-specific features. [•] We have implemented the only dynamic invariant generator available for WS-BPEL. [•] Results show that the solutions are successful. [Copyright &y& Elsevier]

Since McCabe proposed the basic path testing method, researchers has been exploring the efficient algorithm of acquiring the basic path set from a program. Therefore, a path string combination algorithm is proposed to obtain the basis path set. In this algorithm, a program is regarded as a combination of several basic structures, the composition and combination of the basic structure of the path string are created , and the combination rules of the path string are designed. Then, according to these rules, the algorithm of obtaining the basic path set is derived. Experiments show that, under the condition of meeting the same coverage criteria, the algorithm is more concise than the method proposed by McCabe and the intermediate results are easy to understand so as to facilitate the optimization of the artificial test case set. [ABSTRACT FROM AUTHOR]

Whitening the testing of service-oriented applications can provide service consumers confidence on how well an application has been tested. However, to protect business interests of service providers and to prevent information leakage, the implementation details of services are usually invisible to service consumers. This makes it challenging to determine the test coverage of a service composition as a whole and design test cases effectively. To address this problem, we propose an approach to whiten the testing of service compositions based on events exposed by services. By deriving event interfaces to explore only necessary test coverage information from service implementations, our approach allows service consumers to determine test coverage based on selected events exposed by services at runtime without releasing the service implementation details. We also develop an approach to design test cases effectively based on event interfaces concerning both effectiveness and information leakage. The experimental results show that our approach outperforms existing testing approaches for service compositions with up to 49 percent more test coverage and an up to 24 percent higher fault-detection rate. Moreover, our solution can trade off effectiveness, efficiency, and information leakage for test case generation. [ABSTRACT FROM PUBLISHER]

In this study, we examined freshmen students' sorting algorithm implementations in data structures and algorithms' course in two phases: at the beginning of the course before the students received any instruction on sorting algorithms, and after taking a lecture on sorting algorithms. The analysis revealed that many students have insufficient understanding of implementing sorting algorithms. For example, they include unnecessary swaps in their Insertion or Selection sort implementations resulting in more complicated and inefficient code. Based on the data, we present a categorization of these types of variations and discuss the implications of the results. In addition, we introduce an instrument to recognize these algorithms automatically. This is done in terms of white-box testing. Our aim is to develop an automatic assessment system to help teachers in the burden of marking students' assignments and give feedback to the students on their algorithmic solutions. We outline how the presented results can be used to develop the instrument further. [ABSTRACT FROM AUTHOR]

Programmers working on the year 2000 problem need to locate and understand date sensitive code, that is, code whose execution depends on date inputs. This paper presents several dynamic analysis methods for addressing this problem. Date sensitive code can be located by running many test cases that are identical except for a change in one date value. An advanced test coverage tool can recover each test's execution count vector giving the number of times that each basic block was executed. Comparison of the vectors reveals the blocks whose execution is affected by the input date values. We present several methods of analysing the execution count data to locate date algorithms. One method identifies subdomains, that is, ranges of dates that are processed similarly. Another method involves graphical or Fourier analysis to identify common programming patterns such as leap-year computations. The last method exploits the 28-year regularity in dates to look for anomalies in processing. The methods are illustrated using Bellcore's ATAC testing tool on five C programs that use some of the date encodings that year 2000 maintainers may need to locate and understand. [ABSTRACT FROM AUTHOR]

This paper presents a way of generating acceptance and systems test data from documents produced as part of the traditional structured approaches to systems analysis and design. Entity-relationship diagrams are analysed in a fashion similar to boundary-value analysis to generate combinations of entities that should be supported by the system. Data flow diagrams an analysed in a way that generates tests to exercise the passage of each data item through the system. This information is augmented with details from the process specifications to ensure, firstly, that the specifications themselves are tested to branch coverage level and secondly, that no infeasible tests are generated. Finally, the 'entity life histories' are examined and tests generated to evaluate the full range of possible states experienced by the entitles within the system. The result is a common pool of test data requirements and expected results that may be used to test the corresponding development stage (typically, system or acceptance testing) or may be fed into the next development stage as walkthrough or review data. The paper concludes by presenting the results of an initial evaluation of the methods. [ABSTRACT FROM AUTHOR]

This paper presents an improved mathematical model for calculating the solar test factor (STF) and solar reliability factor (SRF) of a photovoltaic (PV) automated equipment. By employing a unified metrics system and a combined testing suite encompassing various energy-efficient testing techniques, the aim of this paper is to determine a general fault coverage and improve the global SRF of a closed-loop dual-axis solar tracking system. Accelerated testing coupled with reliability analysis are essential tools for assessing the performance of modern solar tracking devices since PV system malfunctioning is directly connected to economic loss, which is an important aspect for the solar energy domain. The experimental results show that the unified metrics system is potentially suitable for assessing the reliability evaluation of many types of solar tracking systems. Additionally, the proposed combined testing platform proves efficient regarding fault coverage (overall coverage of 66.35% for all test scenarios), test time (an average of 275 min for 2864 test cycles), and power consumption (zero costs regarding electricity consumption for all considered test cases) points of view. [ABSTRACT FROM AUTHOR]