Using a SAT solver to generate checking sequences

Jourdan, Guy-Vincent and Ural, Hasan and Yenigün, Hüsnü and Zhu, Dong (2009) Using a SAT solver to generate checking sequences. In: 24th International Symposium on Computer and Information Sciences, 2009 (ISCIS 2009), Güzelyurt, Kuzey Kıbrıs

PDF (This is a RoMEO green publisher -- author can archive pre-print (ie pre-refereeing) and publisher's version/PDF ; author cannot archive post-print (ie final draft post-refereeing).) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1109/ISCIS.2009.5291883


Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence from a given FSM which is an input sequence that determines whether an implementation of the FSM is faulty or correct. In this paper, we consider one of these methods, which constructs a checking sequence by reducing the problem of generating a checking sequence to finding a Chinese rural postman tour on a graph induced by the FSM; we re-formulate the constraints used in this method as a set of Boolean formulas; and use a SAT solver to generate a checking sequence of minimal length.

Item Type:Papers in Conference Proceedings
Uncontrolled Keywords:Finite State Machines, Software Testing, Distinguishing Sequences, Checking Sequences, SAT Solvers
Subjects:Q Science > QA Mathematics > QA075 Electronic computers. Computer science
ID Code:12802
Deposited By:Hüsnü Yenigün
Deposited On:19 Nov 2009 12:48
Last Modified:23 Jul 2019 16:51

Repository Staff Only: item control page