Homing Sequence Derivation with Quantified Boolean Satisfiability - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

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.
Fichier principal
Vignette du fichier
449632_1_En_14_Chapter.pdf (337.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01678974 , version 1 (09-01-2018)

Licence

Attribution

Identifiers

Cite

Hung-En Wang, Kuan-Hua Tu, Jie-Hong R. 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⟩
300 View
190 Download

Altmetric

Share

Gmail Facebook X LinkedIn More