Homing sequence derivation with quantified Boolean satisfiability - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Computers Année : 2022

Homing sequence derivation with quantified Boolean satisfiability

Résumé

Homing sequence derivation for nondeterministic finite state machines (NFSMs) has important applications in software/hardware system testing and verification. Unlike prior methods based on explicit tree-based search, in this article we formulate the derivation of a preset/adaptive homing sequence in terms of quantified Boolean formula (QBF) solving. This formulation exploits compact circuit representation of NFSMs and QBF encoding of the existence condition of homing sequence for effective computation. The implicit circuit representation effectively avoids explicit state enumeration, and can be more scalable. Different encoding schemes and QBF solvers are evaluated for their suitability for the homing sequence derivation. Experiments on various computation methods and benchmarks show the generality and feasibility of a proposed approach.
Fichier non déposé

Dates et versions

hal-03549138 , version 1 (31-01-2022)

Identifiants

Citer

Kuan-Hua Tu, Hung-En Wang, Jie-Hong Roland Jiang, Natalia Kushik, Nina Yevtushenko. Homing sequence derivation with quantified Boolean satisfiability. IEEE Transactions on Computers, 2022, 71 (3), pp.696-711. ⟨10.1109/TC.2021.3058302⟩. ⟨hal-03549138⟩
14 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More