Uday P. Khedker

Affiliations:
  • Indian Institute of Technology, Bombay, India


According to our database1, Uday P. Khedker authored at least 48 papers between 1993 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Which Part of the Heap is Useful? Improving Heap Liveness Analysis.
CoRR, 2024

2023
Computing maximum fixed point solutions over feasible paths in data flow analyses.
Sci. Comput. Program., June, 2023

SpComp: A Sparsity Structure-Specific Compilation of Matrix Operations.
CoRR, 2023

2022
A Unified Model for Context-Sensitive Program Analyses: : The Blind Men and the Elephant.
ACM Comput. Surv., 2022

2020
Generalized Points-to Graphs: A Precise and Scalable Abstraction for Points-to Analysis.
ACM Trans. Program. Lang. Syst., 2020

Bidirectionality in flow-sensitive demand-driven analysis.
Sci. Comput. Program., 2020

2019
Path sensitive MFP solutions in presence of intersecting infeasible control flow path segments.
Proceedings of the 28th International Conference on Compiler Construction, 2019

2018
Demand-driven Alias Analysis : Formalizing Bidirectional Analyses for Soundness and Precision.
CoRR, 2018

Generalized Points-to Graphs: A New Abstraction of Memory in the Presence of Pointers.
CoRR, 2018

Computing partially path-sensitive MFP solutions in data flow analyses.
Proceedings of the 27th International Conference on Compiler Construction, 2018

2017
"What's in a name?" going beyond allocation site names in heap analysis.
Proceedings of the 2017 ACM SIGPLAN International Symposium on Memory Management, 2017

2016
Heap Abstractions for Static Analysis.
ACM Comput. Surv., 2016

Flow and Context Sensitive Points-to Analysis using Higher Order Reachability.
CoRR, 2016

Flow- and Context-Sensitive Points-To Analysis Using Generalized Points-To Graphs.
Proceedings of the Static Analysis - 23rd International Symposium, 2016

Scaling Bounded Model Checking by Transforming Programs with Arrays.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2016

Cause Points Analysis for Effective Handling of Alarms.
Proceedings of the 27th IEEE International Symposium on Software Reliability Engineering, 2016

2015
In defense of soundiness: a manifesto.
Commun. ACM, 2015

Value Slice: A New Slicing Concept for Scalable Property Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Efficient elimination of false positives using static analysis.
Proceedings of the 26th IEEE International Symposium on Software Reliability Engineering, 2015

2014
Sliced Slices: Separating Data and Control Influences.
CoRR, 2014

Generalizing the Liveness Based Points-to Analysis.
CoRR, 2014

Buffer Overflow Analysis for C.
CoRR, 2014

2013
Interprocedural data flow analysis in Soot using value contexts.
Proceedings of the 2nd ACM SIGPLAN International Workshop on State Of the Art in Java Program analysis, 2013

2012
A Logic for Correlating Temporal Properties across Program Transformations
CoRR, 2012

Liveness-Based Pointer Analysis.
Proceedings of the Static Analysis - 19th International Symposium, 2012

2011
Lazy Pointer Analysis
CoRR, 2011

2009
Validation of GCC optimizers through trace generation.
Softw. Pract. Exp., 2009

Scalable Context-Sensitive Points-to Analysis Using Multi-dimensional Bloom Filters.
Proceedings of the Programming Languages and Systems, 7th Asian Symposium, 2009

Data Flow Analysis - Theory and Practice.
CRC Press, ISBN: 978-0-8493-2880-0, 2009

2008
Efficiency, Precision, Simplicity, and Generality in Interprocedural Data Flow Analysis: Resurrecting the Classical Call Strings Method.
Proceedings of the Compiler Construction, 17th International Conference, 2008

2007
Heap reference analysis using access graphs.
ACM Trans. Program. Lang. Syst., 2007

An improved bound for call strings based interprocedural analysis of bit vector frameworks.
ACM Trans. Program. Lang. Syst., 2007

Liveness of Heap Data for Functional Programs
CoRR, 2007

Heap Reference Analysis for Functional Programs
CoRR, 2007

Garbage Collection Techniques.
Proceedings of the Compiler Design Handbook: Optimizations and Machine Code Generation, 2007

2006
Structuring Optimizing Transformations and Proving Them Sound.
Proceedings of the 5th International Workshop on Compiler Optimization meets Compiler Verification, 2006

Effectiveness of Garbage Collection in MIT/GNU Scheme
CoRR, 2006

Complexity of Data Flow Analysis for Non-Separable Frameworks
CoRR, 2006

Complexity of Data Flow Analysis for Non-Separable Frameworks.
Proceedings of the International Conference on Software Engineering Research and Practice & Conference on Programming Languages and Compilers, 2006

Static Analysis of Programs: A Heap Centric View.
Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2006), 2006

A PVS Based Framework for Validating Compiler Optimizations.
Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2006), 2006

Static Program Partitioning for Embedded Processors.
Proceedings of the 2006 International Conference on Embedded Systems & Applications, 2006

2005
Heterogeneous Fixed Points with Application to Points-To Analysis.
Proceedings of the Programming Languages and Systems, Third Asian Symposium, 2005

2003
Bidirectional data flow analysis for type inferencing.
Comput. Lang. Syst. Struct., 2003

2002
Data Flow Analysis.
Proceedings of the Compiler Design Handbook: Optimizations and Machine Code Generation, 2002

1999
Bidirectional Data Flow Analysis: Myth and Reality.
ACM SIGPLAN Notices, 1999

1994
A Generalized Theory of Bit Vector Data Flow Analysis.
ACM Trans. Program. Lang. Syst., 1994

1993
Complexity of Bidirectional Data Flow Analysis.
Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993


  Loading...