BINTEST: Binary Search-based Test Case Generation

One of the important tasks during software testing is the generation of test cases. Various approaches have been proposed to automate this task. The approaches available, however, often have problems limiting their use. A problem of dynamic test case generation approaches, for instance, is that a large number of iterations can be necessary to obtain test cases. This article proposes a novel algorithm for path-oriented test case generation based on binary search and describes a possible implementation

Black- and White-Box Self-testing COTS Components

Development of a software system from existing components can surely have various benefits, but can also entail a series of problems. One type of problems is caused by a limited exchange of information between the developer and user of a component, i.e. the developer of a componentbased system. A limited exchange of information cannot only require the testing by the user but it can also complicate this tasks, since vital artifacts, source code in particular, might not be available. Self-testing components can be one response in such situation. This paper describes an enhancement of the Self-Testing COTS Components (STECC) Method so that an appropriately enabled component is not only capable of white-box testing its methods but also capable of black-box testing

A hybrid backtracking algorithm for automatic test data generation

Kao osnovno pitanje u ispitivanju softvera, automatsko generiranje podataka za ispitivanje je od najveće važnosti, što je u biti problem zadovoljavanja ograničenja, a rješava se algoritmima pretraživanja. U našem prethodnom istraživanju za rješenje ograničenja predložena je metoda grananja i ograničavanja, a elaborirane su unaprijedne metode. Zasnovan na intervalnom aritmetičkom i simboličkom izvršenju, ovaj je rad usredotočen na unatražnu metodu, a to je povezivanje unaprijednog provjeravanja i unatražnog ispitivanja usmjerenog konflikta, u cilju poboljšanja učinkovitosti unatražnog praćenja u postupku traženja. Zatvaranja varijabli se koriste kako bi se olakšalo lociranje nesuglasica koje dovode do neriješenih rezultata (dead ends). Empirijski eksperimenti dokazuju učinkovitost predložene hibridne unatražne metode i njenu primjenljivost u inženjerstvu.As a fundamental issue in software testing, automatic test data generation is of crucial importance, which is essentially a constraint satisfaction problem and solved by search algorithms. In our previous research, branch and bound was proposed as our constraint solver and the look-ahead methods were elaborated. Based on interval arithmetic and symbolic execution, this paper focuses on the look-back or backtracking method, which is the hybridization of forward checking and conflict-directed backjumping, with the aim of improving the efficiency of backtracking in the search procedure. The closures of variables are used to facilitate the localization of the conflicts which cause dead ends. Empirical experiments prove the effectiveness of the proposed hybrid backtracking method and its applicability in engineering

BINTEST: Binary Search-based Test Case Generation

One of the important tasks during software testing is the generation of test cases. Various approaches have been proposed to automate this task. The approaches available, however, often have problems limiting their use. A problem of dynamic test case generation approaches, for instance, is that a large number of iterations can be necessary to obtain test cases. This article proposes a novel algorithm for path-oriented test case generation based on binary search and describes a possible implementation

BINTEST - Binary Search-based Test Case Generation

One of the important tasks during software testing is the generation of test cases. Various approaches have been proposed to automate this task. The approaches available, however, often have problems limiting their use. A problem of dynamic test case generation approaches, for instance, is that a large number of iterations can be necessary to obtain test cases. This article proposes a novel algorithm for path-oriented test case generation based on binary search and describes a possible implementation