Feature Interaction Verification Using Unbounded Model Checking with Interpolation

Takafumi MATSUO  Tatsuhiro TSUCHIYA  Tohru KIKUNO  

IEICE TRANSACTIONS on Information and Systems   Vol.E92-D   No.6   pp.1250-1259
Publication Date: 2009/06/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E92.D.1250
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Dependable Computing
unbounded model checking,  interpolation,  feature interaction,  verification,  

Full Text: PDF(210.9KB)>>
Buy this Article

In this paper, we propose an unbounded model checking method for feature interaction verification for telecommunication systems. Unbounded model checking is a SAT-based verification method and has attracted recent attention as a powerful approach. The interpolation-based approach is one of the most promising unbounded model checking methods and has been proven to be effective for hardware verification. However, the application of unbounded model checking to asynchronous systems, such as telecommunication systems, has rarely been practiced. This is because, with the conventional encoding, the behavior of an asynchronous system can only be represented as a large propositional formula, thus resulting in large computational cost. To overcome this problem we propose to use a new scheme for encoding the behavior of the system and adapt the unbounded model checking algorithm to this encoding. By exploiting the concurrency of an asynchronous system, this encoding scheme allows a very concise formula to represent system's behavior. To demonstrate the effectiveness of our approach, we conduct experiments where 21 pairs of telecommunication services are verified using several methods including ours. The results show that our approach exhibits significant speed-up over unbounded model checking using the traditional encoding.