Name
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-67549-7_14 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Nondeterministic algorithm,System testing,Computer science,Boolean satisfiability problem,Algorithm,Finite-state machine,True quantified Boolean formula,Generality,Computation,Encoding (memory) | Conference | 10533 |
ISSN | Citations | PageRank |
0302-9743 | 2 | 0.37 |
References | Authors | |
10 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hung-En Wang | 1 | 9 | 1.15 |
| Kuan-Hua Tu | 2 | 11 | 1.22 |
| Jie-Hong R. Jiang | 3 | 353 | 37.47 |
| Natalia Kushik | 4 | 68 | 16.49 |