Generating Event-Sequence Test Cases by Answer Set Programming with the Incidence Matrix

Technical Communications of the 28th International Conference on Logic Programming

Mutsunori Banbara1, Naoyuki Tamura1, and Katsumi Inoue2 ; 2 National Institute of Informatics

Others  :  http://drops.dagstuhl.de/opus/volltexte/2012/3612/pdf/10.pdf
PID  :  44472

来源: CEUR

【 摘 要 】

The effective use of ASP solvers is essential for enhancing efficiency and scalability. The incidence matrix is a simple representation used in Constraint Programming (CP) and Integer Linear Programming for modeling combinatorial problems. Generating test cases for event-sequence testing is to find a sequence covering array (SCA). In this paper, we consider the problem of finding optimal sequence covering arrays by ASP and CP. Our approach is based on an effective combination of ASP solvers and the incidence matrix. We first present three CP models from different viewpoints of sequence covering arrays: the naïve matrix model, the event-position matrix model, and the incidence matrix model. Particularly, in the incidence matrix model, an SCA can be represented by a (0, 1)-matrix called the incidence matrix of the array in which the coverage constraints of the given SCA can be concisely expressed. We then present an ASP program of the incidence matrix model. It is compact and faithfully reflects the original constraints of the incidence matrix model. In our experiments, we were able to significantly improve the previously known bounds for many arrays of strength three. Moreover, we succeeded either in finding optimal solutions or in improving known bounds for some arrays of strength four.1998 ACM Subject Classification D.1.6 Logic Programming; D.2.5 Testing and Debugging