On the complexity of partially-flow-sensitive alias analysis
- N. Rinetzky
- G. Ramalingam
- et al.
- 2008
- ACM TOPLAS
Publications
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.
Date
Featured collections
Popular topics
30 results for G. Ramalingam
Technical forum: Using logical data models for understanding and transforming legacy business applications
- Satish Chandra
- Jackie de Vries
- et al.
- 2006
- IBM Systems Journal
Typestate verification: Abstraction techniques and complexity results
- J. Field
- D. Goyal
- et al.
- 2005
- Science of Computer Programming
On loops, dominators, and dominance frontiers
- G. Ramalingam
- 2002
- ACM TOPLAS
On sparse evaluation representations
- G. Ramalingam
- 2002
- Theoretical Computer Science
On loops, dominators, and dominance frontier
- G. Ramalingam
- 2000
- SIGPLAN Notices (ACM Special Interest Group on Programming Languages)
Context-sensitive synchronization-sensitive analysis is undecidable
- G. Ramalingam
- 2000
- ACM TOPLAS
On the computational complexity of dynamic graph problems
- G. Ramalingam
- Thomas Reps
- 1996
- Theoretical Computer Science
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
- G. Ramalingam
- Thomas Reps
- 1996
- Journal of Algorithms
The Undecidability of Aliasing
- G. Ramalingam
- 1994
- ACM Transactions on Programming Languages and Systems (TOPLAS)