Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHierons, RM-
dc.contributor.authorTurker, UC-
dc.identifier.citationIEEE Transactions on Software Engineering, (2016)en_US
dc.description.abstractThis paper describes an efficient parallel algorithm that uses many-core GPUs for automatically deriving Unique Input Output sequences (UIOs) from Finite State Machines. The proposed algorithm uses the global scope of the GPU's global memory through coalesced memory access and minimises the transfer between CPU and GPU memory. The results of experiments indicate that the proposed method yields considerably better results compared to a single core UIO construction algorithm. Our algorithm is scalable and when multiple GPUs are added into the system the approach can handle FSMs whose size is larger than the memory available on a single GPU.en_US
dc.description.sponsorshipScientific and Technological Research Council of Turkey (TUBITAK) under grant no 1059B191400424 and by the NVIDIA corporationen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.subjectSoftware engineering/software/program verificationen_US
dc.subjectsoftware engineering/testing and debuggingen_US
dc.subjectSoftware engineering/test designen_US
dc.subjectFinite State Machineen_US
dc.subjectUnique Input Output Sequence generationen_US
dc.subjectGeneral Purpose Graphics Processing Unitsen_US
dc.titleParallel algorithms for testing finite state machines:Generating UIO sequencesen_US
dc.relation.isPartOfIEEE Transactions on Software Engineering-
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf782.6 kBUnknownView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.