Skip to Main content Skip to Navigation
Conference papers

Homing Sequence Derivation with Quantified Boolean Satisfiability

Abstract : Homing sequence derivation for nondeterministic finite state machines (NFSMs) has important applications in system testing and verification. Unlike prior methods based on explicit tree based search, in this work we formulate the derivation of a preset homing sequence in terms of a quantified Boolean formula (QBF). The formulation allows implicit NFSM representation and compact QBF encoding for effective computation. Different encoding schemes and QBF solvers are evaluated for their suitability to homing sequence derivation. Experimental results show the generality and feasibility of the proposed method.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01678974
Contributor : Hal Ifip <>
Submitted on : Tuesday, January 9, 2018 - 3:41:35 PM
Last modification on : Thursday, May 27, 2021 - 8:08:03 AM
Long-term archiving on: : Wednesday, May 23, 2018 - 4:04:12 PM

File

449632_1_En_14_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Hung-En Wang, Kuan-Hua Tu, Jie-Hong Jiang, Natalia Kushik. Homing Sequence Derivation with Quantified Boolean Satisfiability. 29th IFIP International Conference on Testing Software and Systems (ICTSS), Oct 2017, St. Petersburg, Russia. pp.230-242, ⟨10.1007/978-3-319-67549-7_14⟩. ⟨hal-01678974⟩

Share

Metrics

Record views

332

Files downloads

289