In this paper, we propose the path dependency automaton (PDA) to capture the dependencies among the multiple paths in a loop. However, loops are very challenging structures for program analysis, especially when (nested) loops contain multiple paths that have complex interleaving relationships.
#LOOPSTER SOFTWARE SOFTWARE#
The results show that Loopster is effective in a majority of loops with better accuracy and 20 ×+ performance improvement compared to the state-of-the-art tools.Īnalyzing loops is very important for various software engineering tasks such as bug detection, test case generation and program optimization. We evaluate Loopster by applying it on the loop termination competition benchmark and three real-world projects.
Loopster adopts a divide-and-conquer approach: (1) we extract individual paths from a target multi-path loop and analyze the termination of each path, (2) analyze the dependencies between each two paths, and then (3) determine the overall termination of the target loop based on the relations among paths. In this paper, we present a novel approach, named Loopster, which performs an efficient static analysis to decide the termination for loops based on path termination analysis and path dependency reasoning. Existing loop termination analysis techniques mainly depend on the synthesis of ranking functions, which is often expensive. Loop termination is an important problem for proving the correctness of a system and ensuring that the system always reacts.
0 kommentar(er)
