G. Ramalingam

Ganesan Ramalingam, Kapil Vaswani: Fault tolerance via idempotence. POPL 2013: 249-262

David Lo, G. Ramalingam, Venkatesh Prasad Ranganath, Kapil Vaswani: Mining quantified temporal rules: Formalism, algorithms, and evaluation. Sci. Comput. Program. 77(6): 743-759 (2012)

Jose Faleiro, Sriram K. Rajamani, Kaushik Rajan, G. Ramalingam, Kapil Vaswani: CScale - A Programming Model for Scalable and Reliable Distributed Applications. Monterey Workshop 2012: 148-156

Jose M. Falerio, Sriram K. Rajamani, Kaushik Rajan, G. Ramalingam, Kapil Vaswani: Generalized lattice agreement. PODC 2012: 125-134

Ravichandhran Madhavan, G. Ramalingam, Kapil Vaswani: Modular Heap Analysis for Higher-Order Programs. SAS 2012: 370-387

Jyotirmoy V. Deshmukh, G. Ramalingam, Venkatesh Prasad Ranganath, Kapil Vaswani: Logical Concurrency Control from Sequential Proofs. Logical Methods in Computer Science 7(3) (2011)

G. Ramalingam, Eelco Visser: Special issue on Partial Evaluation and Program Manipulation (selected papers from PEPM 2007). Sci. Comput. Program. 76(6): 467-468 (2011)

Bhargav S. Gulavani, Supratik Chakraborty, G. Ramalingam, Aditya V. Nori: Bottom-up shape analysis using LISF. ACM Trans. Program. Lang. Syst. 33(5): 17 (2011)

Guy Golan-Gueta, Nathan Grasso Bronson, Alex Aiken, G. Ramalingam, Mooly Sagiv, Eran Yahav: Automatic fine-grain locking using shape properties. OOPSLA 2011: 225-242

Ravichandhran Madhavan, Ganesan Ramalingam, Kapil Vaswani: Purity Analysis: An Abstract Interpretation Formulation. SAS 2011: 7-24

Akash Lal, G. Ramalingam: Reference count analysis with shallow aliasing. Inf. Process. Lett. 111(2): 57-63 (2010)

Jyotirmoy V. Deshmukh, G. Ramalingam, Venkatesh Prasad Ranganath, Kapil Vaswani: Logical Concurrency Control from Sequential Proofs. ESOP 2010: 226-245

Prakash Prabhu, Ganesan Ramalingam, Kapil Vaswani: Safe programmable speculative parallelism. PLDI 2010: 50-61

Hagit Attiya, G. Ramalingam, Noam Rinetzky: Sequential verification of serializability. POPL 2010: 31-42

Aditya Kanade, Rajeev Alur, Sriram K. Rajamani, Ganesan Ramalingam: Representation dependence testing using program inversion. SIGSOFT FSE 2010: 277-286

Michal Segalov, Tal Lev-Ami, Roman Manevich, Ganesan Ramalingam, Mooly Sagiv: Abstract Transformers for Thread Correlation Analysis. APLAS 2009: 30-46

Sriram K. Rajamani, G. Ramalingam, Venkatesh Prasad Ranganath, Kapil Vaswani: ISOLATOR: dynamically ensuring isolation in comcurrent programs. ASPLOS 2009: 181-192

Bhargav S. Gulavani, Supratik Chakraborty, Ganesan Ramalingam, Aditya V. Nori: Bottom-Up Shape Analysis. SAS 2009: 188-204

David Lo, Ganesan Ramalingam, Venkatesh Prasad Ranganath, Kapil Vaswani: Mining Quantified Temporal Rules: Formalism, Algorithms, and Evaluation. WCRE 2009: 62-71

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)

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)

Josh Berdine, Tal Lev-Ami, Roman Manevich, G. Ramalingam, Shmuel Sagiv: Thread Quantification for Concurrent Shape Analysis. CAV 2008: 399-413

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

Shilpa Bugde, Nachiappan Nagappan, Sriram K. Rajamani, G. Ramalingam: Global Software Servicing: Observational Experiences at Microsoft. ICGSE 2008: 182-191

Roman Manevich, Tal Lev-Ami, Mooly Sagiv, Ganesan Ramalingam, Josh Berdine: Heap Decomposition for Concurrent Shape Analysis. SAS 2008: 363-377

G. Ramalingam (Ed.): Programming Languages and Systems, 6th Asian Symposium, APLAS 2008, Bangalore, India, December 9-11, 2008. Proceedings. Lecture Notes in Computer Science 5356, Springer 2008, isbn 978-3-540-89329-5

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

Roman Manevich, Josh Berdine, Byron Cook, G. Ramalingam, Mooly Sagiv: Shape Analysis by Graph Decomposition. TACAS 2007: 3-18

Saurabh Sinha, G. Ramalingam, Raghavan Komondoor: Parametric Process Model Inference. WCRE 2007: 21-30

Raghavan Komondoor, G. Ramalingam: Recovering Data Models via Guarded Dependences. WCRE 2007: 110-119

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

G. Ramalingam, Eelco Visser (Eds.): Proceedings of the 2007 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, 2007, Nice, France, January 15-16, 2007. ACM 2007, isbn 978-1-59593-620-2

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)

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

Siobhán Clarke, Leon Moonen, Ganesan Ramalingam: 06302 Abstracts Collection -- Aspects For Legacy Applications. Aspects For Legacy Applications 2006

Leon Moonen, Ganesan Ramalingam, Siobhán Clarke: 06302 Summary -- Aspects For Legacy Applications. Aspects For Legacy Applications 2006

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

Ganesan Ramalingam, Raghavan Komondoor, John Field, Saurabh Sinha: Semantics-based reverse engineering of object-oriented data models. ICSE 2006: 192-201

Stephen J. Fink, Eran Yahav, Nurit Dor, G. Ramalingam, Emmanuel Geay: Effective typestate verification in the presence of aliasing. ISSTA 2006: 133-144

John Field, Deepak Goyal, Ganesan Ramalingam, Eran Yahav: Typestate verification: Abstraction techniques and complexity results. Sci. Comput. Program. 58(1-2): 57-82 (2005)

Raghavan Komondoor, Ganesan Ramalingam, Satish Chandra, John Field: Dependent Types for Program Understanding. TACAS 2005: 157-173

Roman Manevich, Eran Yahav, Ganesan Ramalingam, Shmuel Sagiv: Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists. VMCAI 2005: 181-198

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

Eran Yahav, G. Ramalingam: Verifying safety properties using separation and heterogeneous abstractions. PLDI 2004: 25-34

Roman Manevich, Shmuel Sagiv, Ganesan Ramalingam, John Field: Partially Disjunctive Heap Abstraction. SAS 2004: 265-279

John Field, Deepak Goyal, G. Ramalingam, Eran Yahav: Typestate Verification: Abstraction Techniques and Complexity Results. SAS 2003: 439-462

G. Ramalingam: On sparse evaluation representations. Theor. Comput. Sci. 277(1-2): 119-147 (2002)

G. Ramalingam: On loops, dominators, and dominance frontiers. ACM Trans. Program. Lang. Syst. 24(5): 455-490 (2002)

G. Ramalingam, Alex Varshavsky, John Field, Deepak Goyal, Shmuel Sagiv: Deriving Specialized Program Analyses for Certifying Component-Client Conformance. PLDI 2002: 83-94

Roman Manevich, G. Ramalingam, John Field, Deepak Goyal, Shmuel Sagiv: Compactly Representing First-Order Structures for Static Analysis. SAS 2002: 196-212

G. Ramalingam: Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Program. Lang. Syst. 22(2): 416-430 (2000)

G. Ramalingam: On loops, dominators, and dominance frontier. PLDI 2000: 233-241

G. Ramalingam, Junehwa Song, Leo Joskowicz, Raymond E. Miller: Solving Systems of Difference Constraints Incrementally. Algorithmica 23(3): 261-275 (1999)

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)

G. Ramalingam: Identifying Loops in Almost Linear Time. ACM Trans. Program. Lang. Syst. 21(2): 175-188 (1999)

John Field, G. Ramalingam: Identifying Procedural Structure in Cobol Programs. PASTE 1999: 1-10

G. Ramalingam, John Field, Frank Tip: Aggregate Structure Identification and Its Application to Program Analysis. POPL 1999: 119-132

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

G. Ramalingam: On Sparse Evaluation Representations. SAS 1997: 1-15

G. Ramalingam: Bounded Incremental Computation. Lecture Notes in Computer Science 1089, Springer 1996, isbn 3-540-61320-X

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

G. Ramalingam, Thomas W. Reps: On the Computational Complexity of Dynamic Graph Problems. Theor. Comput. Sci. 158(1&2): 233-277 (1996)

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

G. Ramalingam: Data Flow Frequency Analysis. PLDI 1996: 267-277

Junehwa Song, Michelle Y. Kim, G. Ramalingam, Raymond E. Miller, Byoung-Kee Yi: Interactive Authoring of Multimedia Documents. VL 1996: 276-283

John Field, G. Ramalingam, Frank Tip: Parametric Program Slicing. POPL 1995: 379-392

G. Ramalingam, Thomas W. Reps: On Competitive On-Line Algorithms for the Dynamic Priority-Ordering Problem. Inf. Process. Lett. 51(3): 155-161 (1994)

G. Ramalingam: The Undecidability of Aliasing. ACM Trans. Program. Lang. Syst. 16(5): 1467-1471 (1994)

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

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

G. Ramalingam, Thomas W. Reps: Modification Algebras. AMAST 1991: 547-558

G. Ramalingam, Thomas W. Reps: A Theory of Program Modifications. TAPSOFT, Vol.2 1991: 137-152

G. Ramalingam, C. Pandu Rangan: New Sequential and Parallel Algorithms for Interval Graph Recognition. Inf. Process. Lett. 34(4): 215-219 (1990)

G. Ramalingam, C. Pandu Rangan: Total Domination in Interval Graphs Revisited. Inf. Process. Lett. 27(1): 17-21 (1988)

G. Ramalingam, C. Pandu Rangan: A Unified Approach to Domination Problems on Interval Graphs. Inf. Process. Lett. 27(5): 271-274 (1988)