Concurrent Java test generation as a search problem
Uložené v:
| Názov: | Concurrent Java test generation as a search problem |
|---|---|
| Autori: | Yaniv Eytani |
| Prispievatelia: | The Pennsylvania State University CiteSeerX Archives |
| Zdroj: | http://react.cs.uni-sb.de/rv2005/proceedings/4.pdf. |
| Rok vydania: | 2005 |
| Zbierka: | CiteSeerX |
| Popis: | A Random test generator generates executable tests together with their expected results. In the form of a noise-maker, it seeds the program with conditional scheduling primitives (such as yield()) that may cause context switches. As a result different interleavings are potentially produced in different executions of the program. Determining a-priori the set of seeded locations required for a bug to manifest itself is rarely possible. This work proposes to reformulate random test generation of concurrent Java programs as a search problem. Hence, it allows applying a set of well known search techniques from the domain of AI to the input space of the test generator. By iteratively refining the input parameters fed to the test generator, the search process creates testing scenarios (i.e. interleavings) that maximizes predefined objective functions. We develop geneticFinder, a noise-maker that uses a genetic algorithm as a search method. We demonstrate our approach by maximizing two objective functions: the high manifestation rate of concurrent bugs and the exporting of a high degree of debugging information to the user. Experimental results show our approach is effective. 1 |
| Druh dokumentu: | text |
| Popis súboru: | application/pdf |
| Jazyk: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.4673 |
| Dostupnosť: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.4673 http://react.cs.uni-sb.de/rv2005/proceedings/4.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Prístupové číslo: | edsbas.2F42A767 |
| Databáza: | BASE |
Nájsť tento článok vo Web of Science | Abstrakt: | A Random test generator generates executable tests together with their expected results. In the form of a noise-maker, it seeds the program with conditional scheduling primitives (such as yield()) that may cause context switches. As a result different interleavings are potentially produced in different executions of the program. Determining a-priori the set of seeded locations required for a bug to manifest itself is rarely possible. This work proposes to reformulate random test generation of concurrent Java programs as a search problem. Hence, it allows applying a set of well known search techniques from the domain of AI to the input space of the test generator. By iteratively refining the input parameters fed to the test generator, the search process creates testing scenarios (i.e. interleavings) that maximizes predefined objective functions. We develop geneticFinder, a noise-maker that uses a genetic algorithm as a search method. We demonstrate our approach by maximizing two objective functions: the high manifestation rate of concurrent bugs and the exporting of a high degree of debugging information to the user. Experimental results show our approach is effective. 1 |
|---|