Institutional Repository
| faulty interaction identification via constraint solving and optimization | |
| Zhang Jian; Ma Feifei; Zhang Zhiqiang | |
| 2012 | |
| Conference Name | 15th International Conference on Theory and Applications of Satisfiability Testing, SAT 2012 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 186-199 |
| Conference Date | June 17, 2012 - June 20, 2012 |
| Conference Place | Trento, Italy |
| Indexed Type | EI |
| ISSN | 0302-9743 |
| ISBN | 9783642316111 |
| Department | (1) State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China |
| English Abstract | Combinatorial testing (CT) is an important black-box testing method. In CT, the behavior of the system under test (SUT) is affected by several parameters/components. Then CT generates a combinatorial test suite. After the user executes a test suite and starts debugging, some test cases fail and some pass. From the perspective of a black box, the failures are caused by interaction of several parameters. It will be helpful if we can identify a small set of interacting parameters that caused the failures. This paper proposes a new automatic approach to identifying faulty interactions. It uses (pseudo-Boolean) constraint solving and optimization techniques to analyze the execution results of the combinatorial test suite. Experimental results show that the method is quite efficient and it can find faulty combinatorial interactions quickly. They also shed some light on the relation between the size of test suite and the ability of fault localization. © 2012 Springer-Verlag.; Combinatorial testing (CT) is an important black-box testing method. In CT, the behavior of the system under test (SUT) is affected by several parameters/components. Then CT generates a combinatorial test suite. After the user executes a test suite and starts debugging, some test cases fail and some pass. From the perspective of a black box, the failures are caused by interaction of several parameters. It will be helpful if we can identify a small set of interacting parameters that caused the failures. This paper proposes a new automatic approach to identifying faulty interactions. It uses (pseudo-Boolean) constraint solving and optimization techniques to analyze the execution results of the combinatorial test suite. Experimental results show that the method is quite efficient and it can find faulty combinatorial interactions quickly. They also shed some light on the relation between the size of test suite and the ability of fault localization. © 2012 Springer-Verlag. |
| Keyword | Formal Logic Optimization |
| Sponsorship | IBM Research; Intel Corporation; Jasper Technologies; Microsoft Research INRIA; Microsoft Research; NEC |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15773 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Zhang Jian,Ma Feifei,Zhang Zhiqiang. faulty interaction identification via constraint solving and optimization[C],2012:186-199. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment