Ganesan Ramalingam
List of publications from the DBLP Bibliography Server - FAQ
2009 | ||
---|---|---|
56 | EE | Sriram K. Rajamani, G. Ramalingam, Venkatesh Prasad Ranganath, Kapil Vaswani: ISOLATOR: dynamically ensuring isolation in comcurrent programs. ASPLOS 2009: 181-192 |
2008 | ||
55 | G. Ramalingam: Programming Languages and Systems, 6th Asian Symposium, APLAS 2008, Bangalore, India, December 9-11, 2008. Proceedings Springer 2008 | |
54 | EE | Avik Chaudhuri, Prasad Naldurg, Sriram K. Rajamani, G. Ramalingam, Lakshmisubrahmanyam Velaga: EON: modeling and analyzing dynamic access control systems with logic programs. ACM Conference on Computer and Communications Security 2008: 381-390 |
53 | EE | Josh Berdine, Tal Lev-Ami, Roman Manevich, G. Ramalingam, Shmuel Sagiv: Thread Quantification for Concurrent Shape Analysis. CAV 2008: 399-413 |
52 | EE | Roman Manevich, Tal Lev-Ami, Mooly Sagiv, Ganesan Ramalingam, Josh Berdine: Heap Decomposition for Concurrent Shape Analysis. SAS 2008: 363-377 |
51 | EE | Noam Rinetzky, G. Ramalingam, Shmuel Sagiv, Eran Yahav: On the complexity of partially-flow-sensitive alias analysis. ACM Trans. Program. Lang. Syst. 30(3): (2008) |
50 | EE | Stephen J. Fink, Eran Yahav, Nurit Dor, G. Ramalingam, Emmanuel Geay: Effective typestate verification in the presence of aliasing. ACM Trans. Softw. Eng. Methodol. 17(2): (2008) |
2007 | ||
49 | G. Ramalingam, Eelco Visser: Proceedings of the 2007 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, 2007, Nice, France, January 15-16, 2007 ACM 2007 | |
48 | Siobhán Clarke, Leon Moonen, Ganesan Ramalingam: Aspects For Legacy Applications, 26.07. - 29.07.2006 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 | |
47 | EE | Noam Rinetzky, Arnd Poetzsch-Heffter, Ganesan Ramalingam, Mooly Sagiv, Eran Yahav: Modular Shape Analysis for Dynamically Encapsulated Programs. ESOP 2007: 220-236 |
46 | EE | Roman Manevich, Josh Berdine, Byron Cook, G. Ramalingam, Mooly Sagiv: Shape Analysis by Graph Decomposition. TACAS 2007: 3-18 |
45 | EE | Raghavan Komondoor, G. Ramalingam: Recovering Data Models via Guarded Dependences. WCRE 2007: 110-119 |
44 | EE | Saurabh Sinha, G. Ramalingam, Raghavan Komondoor: Parametric Process Model Inference. WCRE 2007: 21-30 |
2006 | ||
43 | EE | Siobhán Clarke, Leon Moonen, Ganesan Ramalingam: 06302 Abstracts Collection -- Aspects For Legacy Applications. Aspects For Legacy Applications 2006 |
42 | EE | Leon Moonen, Ganesan Ramalingam, Siobhán Clarke: 06302 Summary -- Aspects For Legacy Applications. Aspects For Legacy Applications 2006 |
41 | EE | Andrew Walenstein, Mohammad El-Ramly, James R. Cordy, William S. Evans, Kiarash Mahdavi, Markus Pizka, Ganesan Ramalingam, Jürgen Wolff von Gudenberg: Similarity in Programs. Duplication, Redundancy, and Similarity in Software 2006 |
40 | EE | Ganesan Ramalingam, Raghavan Komondoor, John Field, Saurabh Sinha: Semantics-based reverse engineering of object-oriented data models. ICSE 2006: 192-201 |
39 | EE | Stephen J. Fink, Eran Yahav, Nurit Dor, G. Ramalingam, Emmanuel Geay: Effective typestate verification in the presence of aliasing. ISSTA 2006: 133-144 |
38 | EE | Roman Manevich, John Field, Thomas A. Henzinger, G. Ramalingam, Mooly Sagiv: Abstract Counterexample-Based Refinement for Powerset Domains. Program Analysis and Compilation 2006: 273-292 |
37 | EE | Satish Chandra, Jackie De Vries, John Field, Howard M. Hess, Manivannan Kalidasan, Raghavan Komondoor, Frans Nieuwerth, Ganesan Ramalingam, Justin Xue: Technical forum: Using logical data models for understanding and transforming legacy business applications. IBM Systems Journal 45(3): 647-655 (2006) |
2005 | ||
36 | EE | Raghavan Komondoor, Ganesan Ramalingam, Satish Chandra, John Field: Dependent Types for Program Understanding. TACAS 2005: 157-173 |
35 | EE | Roman Manevich, Eran Yahav, Ganesan Ramalingam, Shmuel Sagiv: Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists. VMCAI 2005: 181-198 |
34 | EE | Nurit Dor, John Field, Denis Gopan, Tal Lev-Ami, Alexey Loginov, Roman Manevich, G. Ramalingam, Thomas W. Reps, Noam Rinetzky, Mooly Sagiv, Reinhard Wilhelm, Eran Yahav, Greta Yorsh: Automatic Verification of Strongly Dynamic Software Systems. VSTTE 2005: 82-92 |
33 | EE | John Field, Deepak Goyal, Ganesan Ramalingam, Eran Yahav: Typestate verification: Abstraction techniques and complexity results. Sci. Comput. Program. 58(1-2): 57-82 (2005) |
2004 | ||
32 | EE | Eran Yahav, G. Ramalingam: Verifying safety properties using separation and heterogeneous abstractions. PLDI 2004: 25-34 |
31 | EE | Roman Manevich, Shmuel Sagiv, Ganesan Ramalingam, John Field: Partially Disjunctive Heap Abstraction. SAS 2004: 265-279 |
2003 | ||
30 | EE | John Field, Deepak Goyal, G. Ramalingam, Eran Yahav: Typestate Verification: Abstraction Techniques and Complexity Results. SAS 2003: 439-462 |
2002 | ||
29 | EE | G. Ramalingam, Alex Varshavsky, John Field, Deepak Goyal, Shmuel Sagiv: Deriving Specialized Program Analyses for Certifying Component-Client Conformance. PLDI 2002: 83-94 |
28 | EE | Roman Manevich, G. Ramalingam, John Field, Deepak Goyal, Shmuel Sagiv: Compactly Representing First-Order Structures for Static Analysis. SAS 2002: 196-212 |
27 | EE | G. Ramalingam: On loops, dominators, and dominance frontiers. ACM Trans. Program. Lang. Syst. 24(5): 455-490 (2002) |
26 | EE | G. Ramalingam: On sparse evaluation representations. Theor. Comput. Sci. 277(1-2): 119-147 (2002) |
2000 | ||
25 | EE | G. Ramalingam: On loops, dominators, and dominance frontier. PLDI 2000: 233-241 |
24 | EE | G. Ramalingam: Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Program. Lang. Syst. 22(2): 416-430 (2000) |
1999 | ||
23 | EE | John Field, G. Ramalingam: Identifying Procedural Structure in Cobol Programs. PASTE 1999: 1-10 |
22 | EE | G. Ramalingam, John Field, Frank Tip: Aggregate Structure Identification and Its Application to Program Analysis. POPL 1999: 119-132 |
21 | EE | G. Ramalingam: Identifying Loops in Almost Linear Time. ACM Trans. Program. Lang. Syst. 21(2): 175-188 (1999) |
20 | EE | G. Ramalingam, Junehwa Song, Leo Joskowicz, Raymond E. Miller: Solving Systems of Difference Constraints Incrementally. Algorithmica 23(3): 261-275 (1999) |
19 | EE | Junehwa Song, G. Ramalingam, Raymond E. Miller, Byoung-Kee Yi: Interactive Authoring of Multimedia Documents in a Constraint-Based Authoring System. Multimedia Syst. 7(5): 424-437 (1999) |
1997 | ||
18 | G. Ramalingam, Harini Srinivasan: A Member Lookup Algorithm for C++. PLDI 1997: 18-30 | |
17 | G. Ramalingam: On Sparse Evaluation Representations. SAS 1997: 1-15 | |
1996 | ||
16 | G. Ramalingam: Bounded Incremental Computation Springer 1996 | |
15 | Frank Tip, Jong-Deok Choi, John Field, G. Ramalingam: Slicing Class Hierarchies in C++. OOPSLA 1996: 179-197 | |
14 | G. Ramalingam: Data Flow Frequency Analysis. PLDI 1996: 267-277 | |
13 | Junehwa Song, Michelle Y. Kim, G. Ramalingam, Raymond E. Miller, Byoung-Kee Yi: Interactive Authoring of Multimedia Documents. VL 1996: 276-283 | |
12 | G. Ramalingam, Thomas W. Reps: An Incremental Algorithm for a Generalization of the Shortest-Path Problem. J. Algorithms 21(2): 267-305 (1996) | |
11 | EE | G. Ramalingam, Thomas W. Reps: On the Computational Complexity of Dynamic Graph Problems. Theor. Comput. Sci. 158(1&2): 233-277 (1996) |
1995 | ||
10 | John Field, G. Ramalingam, Frank Tip: Parametric Program Slicing. POPL 1995: 379-392 | |
1994 | ||
9 | G. Ramalingam, Thomas W. Reps: An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph. POPL 1994: 287-296 | |
8 | EE | G. Ramalingam: The Undecidability of Aliasing. ACM Trans. Program. Lang. Syst. 16(5): 1467-1471 (1994) |
7 | G. Ramalingam, Thomas W. Reps: On Competitive On-Line Algorithms for the Dynamic Priority-Ordering Problem. Inf. Process. Lett. 51(3): 155-161 (1994) | |
1993 | ||
6 | G. Ramalingam, Thomas W. Reps: A Categorized Bibliography on Incremental Computation. POPL 1993: 502-510 | |
1991 | ||
5 | G. Ramalingam, Thomas W. Reps: Modification Algebras. AMAST 1991: 547-558 | |
4 | G. Ramalingam, Thomas W. Reps: A Theory of Program Modifications. TAPSOFT, Vol.2 1991: 137-152 | |
1990 | ||
3 | G. Ramalingam, C. Pandu Rangan: New Sequential and Parallel Algorithms for Interval Graph Recognition. Inf. Process. Lett. 34(4): 215-219 (1990) | |
1988 | ||
2 | G. Ramalingam, C. Pandu Rangan: Total Domination in Interval Graphs Revisited. Inf. Process. Lett. 27(1): 17-21 (1988) | |
1 | EE | G. Ramalingam, C. Pandu Rangan: A Unified Approach to Domination Problems on Interval Graphs. Inf. Process. Lett. 27(5): 271-274 (1988) |