Generating a checking sequence with a minimum number of reset transitions-Reference-Cited by-同舟云学术

Generating a checking sequence with a minimum number of reset transitions

Published:2009-12-22 Issue:3 Volume:17 Page:217-250
ISSN:0928-8910
Container-title:Automated Software Engineering
language:en
Short-container-title:Autom Softw Eng

Author:

Hierons R. M.,Ural H.

Publisher

Springer Science and Business Media LLC

Subject

Software

Link

http://link.springer.com/content/pdf/10.1007/s10515-009-0061-0.pdf

Reference27 articles.

1. Aho, A.V., Dahbura, A.T., Lee, D., Uyar, M.U.: An optimization technique for protocol conformance test generation based on UIO sequences and Rural Chinese Postman Tours. In: Protocol Specification, Testing, and Verification VIII, Atlantic City, pp. 75–86. Elsevier, North-Holland (1988)

2. Lecture Notes in Computer Science;M. Barnett,2003

3. Binder, R.V.: Testing Object-Oriented Systems: Models, Patterns, and Tools. Addison-Wesley, Reading (1999)

4. Broekman, B., Notenboom, E.: Testing Embedded Software. Addison-Wesley, London (2003)

5. Chow, T.S.: Testing software design modelled by finite state machines. IEEE Trans. Softw. Eng. 4, 178–187 (1978)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multicore and manycore parallelization of cheap synchronizing sequence heuristics;Journal of Parallel and Distributed Computing;2020-06

2. Parallel brute-force algorithm for deriving reset sequences from deterministic incomplete finite automata;TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES;2019-09-18

3. Testing from Partial Finite State Machines without Harmonised Traces;IEEE Transactions on Software Engineering;2017-11-01

4. Hardness of Deriving Invertible Sequences from Finite State Machines;SOFSEM 2017: Theory and Practice of Computer Science;2017

5. Parallel Algorithms for Testing Finite State Machines:Generating UIO Sequences;IEEE Transactions on Software Engineering;2016-11-01