faulty interaction identification via constraint solving and optimization
文献类型：会议论文
| 作者 | Zhang Jian ; Ma Feifei ; Zhang Zhiqiang |
| 出版日期 | 2012 |
| 会议名称 | 15th International Conference on Theory and Applications of Satisfiability Testing, SAT 2012 |
| 会议日期 | June 17, 2012 - June 20, 2012 |
| 会议地点 | Trento, Italy |
| 关键词 | Formal logic Optimization |
| 页码 | 186-199 |
| 中文摘要 | 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. |
| 收录类别 | EI |
| 会议主办者 | IBM Research; Intel Corporation; Jasper Technologies; Microsoft Research INRIA; Microsoft Research; NEC |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 语种 | 英语 |
| ISSN号 | 0302-9743 |
| ISBN号 | 9783642316111 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/15773]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Zhang Jian,Ma Feifei,Zhang Zhiqiang. faulty interaction identification via constraint solving and optimization[C]. 见:15th International Conference on Theory and Applications of Satisfiability Testing, SAT 2012. Trento, Italy. June 17, 2012 - June 20, 2012. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。