Parallel Algorithms for Testing Finite State Machines:Generating UIO sequences
- Submitting institution
-
Brunel University London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 030-120110-5152
- Type
- D - Journal article
- DOI
-
10.1109/TSE.2016.2539964
- Title of journal
- Ieee Transactions On Software Engineering
- Article number
- -
- First page
- 1077
- Volume
- 42
- Issue
- 11
- ISSN
- 0098-5589
- Open access status
- Out of scope for open access requirements
- Month of publication
- November
- Year of publication
- 2016
- URL
-
http://bura.brunel.ac.uk/handle/2438/12382
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
2 - Software, Systems & Security (SSS)
- Citation count
- 10
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper represents the first attempt at addressing the scalability problem when constructing Unique Input Output Sequences for large completely-specified Finite State Machines through the use of massively parallel GPU technology. Published in the top journal on Software Engineering, the proposed method has not only been found highly scalable and efficient, but also influenced others (e.g., Edinburgh/IIT Hyderabad) in addressing similar challenging issues.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
