|
СТ |
A Theory of Program Modifications |
1991 |
Ramalingam G., Reps T. |
|
|
|
Lecture Notes in Computer Science |
21.05.1991 |
|
СТ |
Slicing Class Hierarchies in C++ |
1996 |
Tip F., Choi J. -D., Field J., Ramalingam G. |
|
|
|
SIGPLAN Notices |
20.02.1997 |
|
СТ |
Data Flow Frequency Analysis |
1996 |
Ramalingam G. |
|
|
|
SIGPLAN Notices |
16.10.1996 |
|
М |
Bounded Incremental Computation |
1996 |
Ramalingam G. |
Lecture Notes in Computer Science |
|
|
|
09.07.1996 |
|
СТ |
A Member Lookup Algorithm for C++ |
1997 |
Ramalingam G., Srinivasan H. |
|
|
|
SIGPLAN Notices |
09.07.1997 |
|
СТ |
On Sparse Evaluation Representations |
1997 |
Ramalingam G. |
|
|
|
Lecture Notes in Computer Science |
20.09.1997 |
|
СТ |
Identifying Loops in Almost Linear Time |
1999 |
Ramalingam G. |
|
|
|
ACM Trans. on Programming Languages and Systems |
23.12.1999 |
|
СТ |
Identifying Procedural Structure in Global Programs |
1999 |
Field J., Ramalingam G. |
|
|
|
Software Engineering Notes |
02.11.1999 |
|
СТ |
Typestate Verification: Abstraction Techniques and Complexity Results |
2003 |
Field J., Goyal D., Ramalingam G., Yahav E. |
|
|
|
Lecture Notes in Computer Science |
18.09.2003 |
