KRAB Algorithm - A Revised Algorithm for Incremental Call Graph Generation
Rajasekhara Babu, Krishnakumar V., George Abraham, Kiransinh Borasia

TL;DR
This paper introduces the KRAB algorithm, an improved incremental call graph generation method that outperforms previous algorithms, especially on recursive code, and efficiently handles function skips and exceptions.
Contribution
The paper presents the KRAB algorithm, a novel incremental call graph algorithm with enhanced performance and capabilities over existing methods.
Findings
Better overall performance than previous algorithms
Excellent performance on recursive code
Efficient handling of function skips and exceptions
Abstract
This paper is aimed to present the importance and implementation of an incremental call graph plugin. An algorithm is proposed for the call graph implementation which has better overall performance than the algorithm that has been proposed previously. In addition to this, the algorithm has been empirically proved to have excellent performance on recursive codes. The algorithm also readily checks for function skip and returns exceptions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Parallel Computing and Optimization Techniques · Formal Methods in Verification
