Search the dblp DataBase
Uday P. Khedker :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Aditya Kanade , Uday P. Khedker , Amitabha Sanyal Heterogeneous Fixed Points with Application to Points-To Analysis. [Citation Graph (0, 0)][DBLP ] APLAS, 2005, pp:298-314 [Conf ] Bageshri Sathe , Uday P. Khedker Static Program Partitioning for Embedded Processors. [Citation Graph (0, 0)][DBLP ] ESA, 2006, pp:31-37 [Conf ] Dhananjay M. Dhamdhere , Uday P. Khedker Complexity of Bidirectional Data Flow Analysis. [Citation Graph (0, 0)][DBLP ] POPL, 1993, pp:397-408 [Conf ] Aditya Kanade , Amitabha Sanyal , Uday P. Khedker A PVS Based Framework for Validating Compiler Optimizations. [Citation Graph (0, 0)][DBLP ] SEFM, 2006, pp:108-117 [Conf ] Uday P. Khedker Static Analysis of Programs: A Heap Centric View. [Citation Graph (0, 0)][DBLP ] SEFM, 2006, pp:261- [Conf ] Bageshri Sathe , Uday P. Khedker Complexity of Data Flow Analysis for Non-Separable Frameworks. [Citation Graph (0, 0)][DBLP ] Software Engineering Research and Practice, 2006, pp:828-836 [Conf ] Uday P. Khedker , Dhananjay M. Dhamdhere , Alan Mycroft Bidirectional data flow analysis for type inferencing. [Citation Graph (0, 0)][DBLP ] Computer Languages, Systems & Structures, 2003, v:29, n:1-2, pp:15-44 [Journal ] Uday P. Khedker , Dhananjay M. Dhamdhere Bidirectional Data Flow Analysis: Myth and Reality. [Citation Graph (0, 0)][DBLP ] SIGPLAN Notices, 1999, v:34, n:6, pp:47-57 [Journal ] Uday P. Khedker , Dhananjay M. Dhamdhere A Generalized Theory of Bit Vector Data Flow Analysis. [Citation Graph (0, 0)][DBLP ] ACM Trans. Program. Lang. Syst., 1994, v:16, n:5, pp:1472-1511 [Journal ] Amey Karkare , Uday P. Khedker , Amitabha Sanyal Liveness of Heap Data for Functional Programs [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Amey Karkare , Amitabha Sanyal , Uday P. Khedker Effectiveness of Garbage Collection in MIT/GNU Scheme [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Bageshri Karkare , Uday P. Khedker Complexity of Data Flow Analysis for Non-Separable Frameworks [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Uday P. Khedker , Amitabha Sanyal , Amey Karkare Heap Reference Analysis Using Access Graphs [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Amey Karkare , Amitabha Sanyal , Uday P. Khedker Heap Reference Analysis for Functional Programs [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Aditya Kanade , Amitabha Sanyal , Uday P. Khedker Structuring Optimizing Transformations and Proving Them Sound. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2007, v:176, n:3, pp:79-95 [Journal ] Bageshri Karkare , Uday P. Khedker An improved bound for call strings based interprocedural analysis of bit vector frameworks. [Citation Graph (0, 0)][DBLP ] ACM Trans. Program. Lang. Syst., 2007, v:29, n:6, pp:- [Journal ] Scalable Context-Sensitive Points-to Analysis Using Multi-dimensional Bloom Filters. [Citation Graph (, )][DBLP ] Efficiency, Precision, Simplicity, and Generality in Interprocedural Data Flow Analysis: Resurrecting the Classical Call Strings Method. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.004secs