The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We present a model-based testing approach for reactive systems where both test inputs and expected results are generated from ‘restricted’ Event-B specifications. We show that it is possible to automatically build the restricted Event-B specifications from the original ones base on a knowledge base of the system under tests. The restricted models are to reduce the state space of the original Event-B...
We consider properties of edge-colored vertex-ordered graphs} – graphs with a totally ordered vertex set and a finite set of possible edge colors – showing that any hereditary property of such graphs is strongly testable, i.e., testable with a constant number of queries. We also explain how the proof can be adapted to show that any hereditary property of two-dimensional matrices...
Automatically generating unit tests is a powerful approach to exercise complex software. Unfortunately, current techniques often fail to provide relevant input values, such as strings that bypass domain-specific sanity checks. As a result, state-of-the-art techniques are effective for generic classes, such as collections, but less successful for domain-specific software. This paper presents TestMiner,...
We provide a combinatorial characterization of all testable properties of k-graphs (i.e. k-uniform hypergraphs). Here, a k-graph property P is testable if there is a randomized algorithm which makes a bounded number of edge queries and distinguishes with probability 2/3 between k-graphs that satisfy P and those that are far from satisfying P. For the 2-graph case, such a combinatorial characterization...
Computer Science 2 is one of the core elements of any computer science program; however, there has been little progress towards the development of a concept inventory for this key introductory course for CS majors. Plans to address this gap using the Delphi method are presented. Instructors and researchers with knowledge and experience of CS2 are being recruited to help identify concepts from CS2...
Automatic loop-invariant generation is important in program analysis and verification. In this paper, we propose to generate loop-invariants automatically through learning and verification. Given a Hoare triple of a program containing a loop, we start with randomly testing the program, collect program states at run-time and categorize them based on whether they satisfy the invariant to be discovered...
We give an adaptive algorithm that tests whether an unknown Boolean function f: {0,1}^n -≈ {0, 1} is unate (i.e. every variable of f is either non-decreasing or non-increasing) or ≥-far from unate with one-sided error and O(n^{3/4}/≥^2) many queries. This improves on the best adaptive O(n/≥)-query algorithm from Baleshzar, Chakrabarty, Pallavoor, Raskhodnikova...
We study regular expression membership testing: Given a regular expression of size m and a string of size n, decide whether the string is in the language described by the regular expression. Its classic O(nm) algorithm is one of the big success stories of the 70s, which allowed pattern matching to develop into the standard tool that it is today.Many special cases of pattern matching have been studied...
In this work, we revisit the problem of uniformity testing of discrete probability distributions. A fundamental problem in distribution testing, testing uniformity over a known domain has been addressed over a significant line of works, and is by now fully understood. The complexity of deciding whether an unknown distribution is uniform over its unknown (and arbitrary) support, however, is much less...
Model-Based Testing rises hopes of project teams of meeting both eager time and budget constraints as well as achieving better system quality by thorough testing. However, toolchain and method impose a certain skill set on the project engineer. This paper presents a possible way forward and introduces the constraints to the system architecture.
Real-time face recognition system process divided into three steps, feature extraction, clustering, detection, and recognition. Each step uses a different method that is Local Binary Pattern (LBP), Agglomerative Hierarchical Clustering (AHC) and Euclidean Distance. Content Based Image Retrieval (CBIR), an image searching techniques based on image feature, is implemented as the searching method. Based...
Crowdsourced testing is an emerging trend in software testing, which relies on crowd workers to accomplish test tasks. Due to the cost constraint, a test task usually involves a limited number of crowd workers. Furthermore, more workers does not necessarily result in detecting more bugs. Different workers, who may have different testing experience and expertise, may make much differences in the test...
Test case prioritization (TCP) attempts to order test cases such that those which are more important, according to some criterion or measurement, are executed earlier. TCP has been applied in many testing situations, including, for example, regression testing. An abstract test case (also called a model input) is an important type of test case, and has been widely used in practice, such as in configurable...
There are many research works on automated GUI traversal-based test case generation techniques for Android application. However, the effect of different factors used in a GUI traversal algorithm has not been systematically explored. In this work, we report a controlled experiment on 33 real-world applications to expose their real failures to systematically study three major factors that are commonly...
A large amount of risk evaluation formulas have been proposed for spectrum-based fault localization (SBFL) in prior studies. A recent study by Xie et al. developed an innovative framework to theoretically analyze the effectiveness of those risk evaluation formulas in SBFL. Xie et al.'s study was based on the assumption that program has only one fault. In other words, they investigated SBFL in the...
Mobile computing devices facilitate our daily lives, however, overuse of such may cause visual discomfort or even injure our eyes. Thus, personal visual health management is very important. Current eye fatigue examination methods include the critical flicker fusion test and Heuer's 10-point scale questionnaire. However, the flicker fusion system is too heavy and too expensive for general use by average...
Combinatorial interaction testing (CIT) stands as one of the efficient testing techniques that have been used in different applications recently. The technique is useful when there is a need to take the interaction of input parameters into consideration for testing a system. The key insight the technique is that not every single parameter may contribute to the failure of the system and there could...
The classification of dynamical data streams is among the most complex problems encountered in classification. This is, firstly, because the distribution of the data streams is non-stationary, and it changes without any prior “warning”. Secondly, the manner in which it changes is also unknown. Thirdly, and more interestingly, the model operates with the assumption that the correct classes of previously-classified...
Abstract test case prioritization (ATCP) aims at ordering abstract test case in order to increase the speed at which faults are detected, potentially increasing the fault detection rate. This paper empirically examines possible ATCP techniques, according to the following four categories: non-information-guided prioritization (NIGP), interaction coverage based prioritization (ICBP), input-model mutation...
Using topic modeling, we analyse the titles and abstracts of nearly 10,000 papers from 20 years published in 11 top-ranked Software Engineering(SE) conferences between 1993 to 2013. Seven topics are identified as the dominant themes in modern software engineering. We show that these topics are not static, rather, some of them are becoming decidedly less prominent over time (modeling) while others...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.