Abstract
Fog computing plays an important role in industrial and information process. The programs in fog computing, such as iFogSim toolkit, usually contain some infeasible paths (paths that cannot be covered), which makes it impossible to compare algorithm in models that require covering all paths. In this paper, we proposed a mathematical model to build automated test case generation based on path coverage (ATCG-PC) in fog computing programs as a single-objective problem. Single objective helps to reduce the cost of evaluation functions, which is proportional to the number of test cases. When infeasible paths are contained in tested programs, algorithms can also be compared in this model. In this paper, classical differential evolution (DE) is used to solve the ATCG-PC. However, it is difficult for DE to use generated test cases covering remaining paths in the ATCG-PC of fog computing. Therefore, we proposed a test-case-path relationship matrix to empower DE (RP-DE). Experiment results show that RP-DE uses significantly less test cases and achieves higher path coverage rate than compared state-of-the-art algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
