1 citations · 2 across the 6 of their papers we have counts for
6 papers
Which Part of the Heap is Useful? Improving Heap Liveness Analysis
Vini Kanvar, Uday P. Khedker
With the growing sizes of data structures allocated in heap, understanding the actual use of heap memory is critically important for minimizing cache misses and reclaiming unused m…
Computing Maximum Fixed Point Solutions over Feasible Paths in Data Flow Analyses
Komal Pathade, Uday Khedker
The control flow graph (CFG) representation of a procedure used by virtually all flow-sensitive program analyses, admits a large number of infeasible control flow paths i.e., these…
Scaling Bounded Model Checking By Transforming Programs With Arrays
Anushri Jana, Uday P. Khedker, Advaita Datar +2
Bounded Model Checking is one the most successful techniques for finding bugs in program. However, for programs with loops iterating over large-sized arrays, bounded model checkers…
Buffer Overflow Analysis for C
Uday P. Khedker
Buffer overflow detection and mitigation for C programs has been an important concern for a long time. This paper defines a string buffer overflow analysis for C programs. The key…
Generalizing the Liveness Based Points-to Analysis
Uday P. Khedker, Vini Kanvar
The original liveness based flow and context sensitive points-to analysis (LFCPA) is restricted to scalar pointer variables and scalar pointees on stack and static memory. In this…
Sliced Slices: Separating Data and Control Influences
Shrawan Kumar, Amitabha Sanyal, Uday Khedker
Backward slicing has been used extensively in program understanding, debugging and scaling up of program analysis. For large programs, the size of the conventional backward slice i…