Evaluating CodeQL for Automated Runtime Complexity Approximation
Name
Tõnis Hendrik Hlebnikov
Abstract
Runtime complexity describes the execution time of a program as a function of its input size. Manual derivation of it is complex and time-consuming. As a result, automated tools that are less complex and time-consuming to use have been developed. The objective is to evaluate whether CodeQL, a tool primarily used for security analysis, could additionally facilitate runtime complexity analysis. This is evaluated through the implementation of a minimal proof-of-concept analysis which is able to provide correct estimations for some Java programs. The implications of this tool, and the process of creating it, are discussed.
Graduation Thesis language
English
Graduation Thesis type
Master - Computer Science
Supervisor(s)
Vesal Vojdani
Defence year
2023