Ganesan Ramalingam - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

2011

Special issue on Partial Evaluation and Program Manipulation (selected papers from PEPM 2007)Ganesan Ramalingam, Eelco Visser. SCP, 76(6):467-468, June 2011. [doi]

2010

Sequential verification of serializabilityHagit Attiya, Ganesan Ramalingam, Noam Rinetzky. POPL 2010: 31-42 [doi]

Logical Concurrency Control from Sequential ProofsJyotirmoy Deshmukh, Ganesan Ramalingam, Venkatesh Prasad Ranganath, Kapil Vaswani. ESOP 2010: 226-245 [doi]

2009

2008

Thread Quantification for Concurrent Shape AnalysisJosh Berdine, Tal Lev-Ami, Roman Manevich, Ganesan Ramalingam, Shmuel Sagiv. cav 2008: 399-413 [doi]

EON: modeling and analyzing dynamic access control systems with logic programsAvik Chaudhuri, Prasad Naldurg, Sriram K. Rajamani, Ganesan Ramalingam, Lakshmisubrahmanyam Velaga. ccs 2008: 381-390 [doi]

Effective typestate verification in the presence of aliasingStephen J. Fink, Eran Yahav, Nurit Dor, Ganesan Ramalingam, Emmanuel Geay. TOSEM, 17(2), 2008. [doi]

Heap Decomposition for Concurrent Shape AnalysisRoman Manevich, Tal Lev-Ami, Mooly Sagiv, Ganesan Ramalingam, Josh Berdine. SAS 2008: 363-377 [doi]

Programming Languages and Systems, 6th Asian Symposium, APLAS 2008, Bangalore, India, December 9-11, 2008. ProceedingsGanesan Ramalingam, editor, Volume 5356 of Lecture Notes in Computer Science, Springer, 2008.

On the complexity of partially-flow-sensitive alias analysisNoam Rinetzky, Ganesan Ramalingam, Shmuel Sagiv, Eran Yahav. TOPLAS, 30(3), 2008. [doi]

2007

Aspects For Legacy Applications, 26.07. - 29.07.2006Siobhán Clarke, Leon Moonen, Ganesan Ramalingam, editors, Volume 06302 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2007.

Recovering Data Models via Guarded DependencesRaghavan Komondoor, Ganesan Ramalingam. wcre 2007: 110-119 [doi]

Shape Analysis by Graph DecompositionRoman Manevich, Josh Berdine, Byron Cook, Ganesan Ramalingam, Mooly Sagiv. TACAS 2007: 3-18 [doi]

Proceedings of the 2007 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, 2007, Nice, France, January 15-16, 2007Ganesan Ramalingam, Eelco Visser, editors, ACM, 2007.

Modular Shape Analysis for Dynamically Encapsulated ProgramsNoam Rinetzky, Arnd Poetzsch-Heffter, Ganesan Ramalingam, Mooly Sagiv, Eran Yahav. ESOP 2007: 220-236 [doi]

Parametric Process Model InferenceSaurabh Sinha, Ganesan Ramalingam, Raghavan Komondoor. wcre 2007: 21-30 [doi]

2006

Technical forum: Using logical data models for understanding and transforming legacy business applicationsSatish Chandra, Jackie De Vries, John Field, Howard M. Hess, Manivannan Kalidasan, Raghavan Komondoor, Frans Nieuwerth, Ganesan Ramalingam, Justin Xue. IBMSJ, 45(3):647-655, 2006. [doi]

06302 Abstracts Collection -- Aspects For Legacy ApplicationsSiobhán Clarke, Leon Moonen, Ganesan Ramalingam. dagstuhl 2007: [doi]

Effective typestate verification in the presence of aliasingStephen J. Fink, Eran Yahav, Nurit Dor, Ganesan Ramalingam, Emmanuel Geay. ISSTA 2006: 133-144 [doi]

Abstract Counterexample-Based Refinement for Powerset DomainsRoman Manevich, John Field, Thomas A. Henzinger, Ganesan Ramalingam, Mooly Sagiv. birthday 2007: 273-292 [doi]

06302 Summary -- Aspects For Legacy ApplicationsLeon Moonen, Ganesan Ramalingam, Siobhán Clarke. dagstuhl 2007: [doi]

Semantics-based reverse engineering of object-oriented data modelsGanesan Ramalingam, Raghavan Komondoor, John Field, Saurabh Sinha. ICSE 2006: 192-201 [doi]

Similarity in ProgramsAndrew Walenstein, Mohammad El-Ramly, James R. Cordy, William S. Evans, Kiarash Mahdavi, Markus Pizka, Ganesan Ramalingam, Jürgen Wolff von Gudenberg. dagstuhl 2007: [doi]

2005

2004

Partially Disjunctive Heap AbstractionRoman Manevich, Shmuel Sagiv, Ganesan Ramalingam, John Field. SAS 2004: 265-279 [doi]

Verifying safety properties using separation and heterogeneous abstractionsEran Yahav, Ganesan Ramalingam. PLDI 2004: 25-34 [doi]

2003

Typestate Verification: Abstraction Techniques and Complexity ResultsJohn Field, Deepak Goyal, Ganesan Ramalingam, Eran Yahav. SAS 2003: 439-462 [doi]

2002

2000

Context-sensitive synchronization-sensitive analysis is undecidableGanesan Ramalingam. TOPLAS, 22(2):416-430, 2000. [doi]

On loops, dominators, and dominance frontierGanesan Ramalingam. PLDI 2000: 233-241 [doi]

1999

1997

On Sparse Evaluation RepresentationsGanesan Ramalingam. SAS 1997: 1-15

A Member Lookup Algorithm for C++Ganesan Ramalingam, Harini Srinivasan. PLDI 1997: 18-30

1996

On the Computational Complexity of Dynamic Graph ProblemsGanesan Ramalingam, Thomas W. Reps. TCS, 158(1&2):233-277, 1996. [doi]

Bounded Incremental ComputationGanesan Ramalingam. Volume 1089 of Lecture Notes in Computer Science, Springer, 1996.

An Incremental Algorithm for a Generalization of the Shortest-Path ProblemGanesan Ramalingam, Thomas W. Reps. jal, 21(2):267-305, 1996.

Data Flow Frequency AnalysisGanesan Ramalingam. PLDI 1996: 267-277

Interactive Authoring of Multimedia DocumentsJunehwa Song, Michelle Y. Kim, Ganesan Ramalingam, Raymond E. Miller, Byoung-Kee Yi. vl 1996: 276-283

Slicing Class Hierarchies in C++Frank Tip, Jong-Deok Choi, John Field, Ganesan Ramalingam. OOPSLA 1996: 179-197

1995

Parametric Program SlicingJohn Field, Ganesan Ramalingam, Frank Tip. POPL 1995: 379-392

1994

The Undecidability of AliasingGanesan Ramalingam. TOPLAS, 16(5):1467-1471, 1994. [doi]

An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible FlowgraphGanesan Ramalingam, Thomas W. Reps. POPL 1994: 287-296

On Competitive On-Line Algorithms for the Dynamic Priority-Ordering ProblemGanesan Ramalingam, Thomas W. Reps. ipl, 51(3):155-161, 1994.

1993

A Categorized Bibliography on Incremental ComputationGanesan Ramalingam, Thomas W. Reps. POPL 1993: 502-510

1991

Modification AlgebrasGanesan Ramalingam, Thomas W. Reps. amast 1992: 547-558

A Theory of Program ModificationsGanesan Ramalingam, Thomas W. Reps. tapsoft 1991: 137-152

1990

New Sequential and Parallel Algorithms for Interval Graph RecognitionGanesan Ramalingam, C. Pandu Rangan. ipl, 34(4):215-219, 1990.

1988

A Unified Approach to Domination Problems on Interval GraphsGanesan Ramalingam, C. Pandu Rangan. ipl, 27(5):271-274, 1988. [doi]

Total Domination in Interval Graphs RevisitedGanesan Ramalingam, C. Pandu Rangan. ipl, 27(1):17-21, 1988.