Skip navigation
Run Run Shaw Library City University of Hong KongRun Run Shaw Library

Please use this identifier to cite or link to this item: http://dspace.cityu.edu.hk/handle/2031/7517
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTsui, Toen_US
dc.date.accessioned2015-03-31T01:48:57Z
dc.date.accessioned2017-09-19T08:50:57Z
dc.date.accessioned2019-02-12T06:53:08Z-
dc.date.available2015-03-31T01:48:57Z
dc.date.available2017-09-19T08:50:57Z
dc.date.available2019-02-12T06:53:08Z-
dc.date.issued2014en_US
dc.identifier.other2014cstt039en_US
dc.identifier.urihttp://144.214.8.231/handle/2031/7517-
dc.description.abstractMulticore hardware makes performance faster. With the pervasiveness of software and hardware support, concurrent computing is widely applied. While enjoying its benefits, there is also a new challenge – concurrent bug. Concurrent bug is a fault caused by thread interleavings. In concurrent computing, threads are interleaved with each other to simulate as executing in parallel. But, in fact, threads are executed one by one in a small time slice, and communicate with each other (for example, by shared memory). Maple is one of several automatic concurrent bugs’ detection software successfully applying dynamic analysis to reveal bugs such as data race and deadlock. In addition, it generates histories of tested and failed-to-test interleaving schedules. It gives a progressive method for developer to test their software. While Maple is good at detecting concurrent bugs in an input, it is not without its flaws. This project has observed two situations of Maple that are possible to be improved. The two situations are lack of accurate coverage across version and inability to va lidating concurrent bug-fixing. First, Maple treats versions of a program as totally different programs. It requires a full set of retest processes on every version. It is clearly a time consuming process, as developers and testers often under stress of new version release. Second, once a concurrent bug is exposed by Maple, developers will try to resolve it. However, after suspicious codes were modified, the developers have no information to determine whether the bug is actually fixed. In the current approach, they can only retest all possible interleaving schedules. To this end, this project proposes a new regression coverage driven testing tool – RegressionMaple. It apply the concept of regression testing (with assumption of similar execution context) to linkage testing information from two versions of a program, thus improve Maple with respect to the above two problems.en_US
dc.rightsThis work is protected by copyright. Reproduction or distribution of the work in any format is prohibited without written permission of the copyright owner.en_US
dc.rightsAccess is restricted to CityU users.en_US
dc.titleRegressionMaple: regression coverage of concurrent testing on validating bug-fixingen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.description.supervisorSupervisor: Dr. Chan, Wing Kwong Ricky; First Reader: Dr. Wang, Jiying; Second Reader: Dr. Yu, Yuen Taken_US
Appears in Collections:Computer Science - Undergraduate Final Year Projects 

Files in This Item:
File SizeFormat 
fulltext.html145 BHTMLView/Open
Show simple item record


Items in Digital CityU Collections are protected by copyright, with all rights reserved, unless otherwise indicated.

Send feedback to Library Systems
Privacy Policy | Copyright | Disclaimer