Model Checking in the Presence of Schedulers Using a Domain-Specific Language for Scheduling Policies

Nhat-Hoa TRAN  Yuki CHIBA  Toshiaki AOKI  

IEICE TRANSACTIONS on Information and Systems   Vol.E102-D   No.7   pp.1280-1295
Publication Date: 2019/07/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2017EDP7391
Type of Manuscript: PAPER
Category: Software System
concurrent system,  model checking,  domain-specific language,  system behaviors,  scheduler,  

Full Text: PDF>>
Buy this Article

A concurrent system consists of multiple processes that are run simultaneously. The execution orders of these processes are defined by a scheduler. In model checking techniques, the scheduling policy is closely related to the search algorithm that explores all of the system states. To ensure the correctness of the system, the scheduling policy needs to be taken into account during the verification. Current approaches, which use fixed strategies, are only capable of limited kinds of policies and are difficult to extend to handle the variations of the schedulers. To address these problems, we propose a method using a domain-specific language (DSL) for the succinct specification of different scheduling policies. Necessary artifacts are automatically generated from the specification to analyze the behaviors of the system. We also propose a search algorithm for exploring the state space. Based on this method, we develop a tool to verify the system with the scheduler. Our experiments show that we could serve the variations of the schedulers easily and verify the systems accurately.