Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
G. Ramalingam
Ganesan Ramalingam
2010 – today
- 2013
[c50]Guy Golan-Gueta, G. Ramalingam, Mooly Sagiv, Eran Yahav: Concurrent libraries with foresight. PLDI 2013: 263-274- [c49]
- [i1]Bettina Kemme, Ganesan Ramalingam, André Schiper, Marc Shapiro, Kapil Vaswani: Consistency in Distributed Systems (Dagstuhl Seminar 13081). Dagstuhl Reports 3(2): 92-126 (2013)
- 2012
- [j22]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)
- [c48]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
- [c47]Jose M. Falerio, Sriram K. Rajamani, Kaushik Rajan, G. Ramalingam, Kapil Vaswani: Generalized lattice agreement. PODC 2012: 125-134
- [c46]Ravichandhran Madhavan, G. Ramalingam, Kapil Vaswani: Modular Heap Analysis for Higher-Order Programs. SAS 2012: 370-387
- 2011
- [j21]Jyotirmoy V. Deshmukh, G. Ramalingam, Venkatesh Prasad Ranganath, Kapil Vaswani: Logical Concurrency Control from Sequential Proofs. Logical Methods in Computer Science 7(3) (2011)
- [j20]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)
- [j19]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)
- [c45]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
- [c44]Ravichandhran Madhavan, Ganesan Ramalingam, Kapil Vaswani: Purity Analysis: An Abstract Interpretation Formulation. SAS 2011: 7-24
- 2010
- [j18]Akash Lal, G. Ramalingam: Reference count analysis with shallow aliasing. Inf. Process. Lett. 111(2): 57-63 (2010)
- [c43]Jyotirmoy V. Deshmukh, G. Ramalingam, Venkatesh Prasad Ranganath, Kapil Vaswani: Logical Concurrency Control from Sequential Proofs. ESOP 2010: 226-245
- [c42]Prakash Prabhu, Ganesan Ramalingam, Kapil Vaswani: Safe programmable speculative parallelism. PLDI 2010: 50-61
- [c41]Hagit Attiya, G. Ramalingam, Noam Rinetzky: Sequential verification of serializability. POPL 2010: 31-42
- [c40]Aditya Kanade, Rajeev Alur, Sriram K. Rajamani, Ganesan Ramalingam: Representation dependence testing using program inversion. SIGSOFT FSE 2010: 277-286
2000 – 2009
- 2009
- [c39]Michal Segalov, Tal Lev-Ami, Roman Manevich, Ganesan Ramalingam, Mooly Sagiv: Abstract Transformers for Thread Correlation Analysis. APLAS 2009: 30-46
- [c38]Sriram K. Rajamani, G. Ramalingam, Venkatesh Prasad Ranganath, Kapil Vaswani: ISOLATOR: dynamically ensuring isolation in comcurrent programs. ASPLOS 2009: 181-192
- [c37]Bhargav S. Gulavani, Supratik Chakraborty, Ganesan Ramalingam, Aditya V. Nori: Bottom-Up Shape Analysis. SAS 2009: 188-204
- [c36]David Lo, Ganesan Ramalingam, Venkatesh Prasad Ranganath, Kapil Vaswani: Mining Quantified Temporal Rules: Formalism, Algorithms, and Evaluation. WCRE 2009: 62-71
- 2008
- [j17]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)
- [j16]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)
- [c35]Josh Berdine, Tal Lev-Ami, Roman Manevich, G. Ramalingam, Shmuel Sagiv: Thread Quantification for Concurrent Shape Analysis. CAV 2008: 399-413
- [c34]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
- [c33]Shilpa Bugde, Nachiappan Nagappan, Sriram K. Rajamani, G. Ramalingam: Global Software Servicing: Observational Experiences at Microsoft. ICGSE 2008: 182-191
- [c32]Roman Manevich, Tal Lev-Ami, Mooly Sagiv, Ganesan Ramalingam, Josh Berdine: Heap Decomposition for Concurrent Shape Analysis. SAS 2008: 363-377
- [e3]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
- 2007
- [c31]Noam Rinetzky, Arnd Poetzsch-Heffter, Ganesan Ramalingam, Mooly Sagiv, Eran Yahav: Modular Shape Analysis for Dynamically Encapsulated Programs. ESOP 2007: 220-236
- [c30]Roman Manevich, Josh Berdine, Byron Cook, G. Ramalingam, Mooly Sagiv: Shape Analysis by Graph Decomposition. TACAS 2007: 3-18
- [c29]Saurabh Sinha, G. Ramalingam, Raghavan Komondoor: Parametric Process Model Inference. WCRE 2007: 21-30
- [c28]Raghavan Komondoor, G. Ramalingam: Recovering Data Models via Guarded Dependences. WCRE 2007: 110-119
- [e2]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
- [e1]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
- 2006
- [j15]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)
- [c27]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
- [c26]Siobhán Clarke, Leon Moonen, Ganesan Ramalingam: 06302 Abstracts Collection -- Aspects For Legacy Applications. Aspects For Legacy Applications 2006
- [c25]Leon Moonen, Ganesan Ramalingam, Siobhán Clarke: 06302 Summary -- Aspects For Legacy Applications. Aspects For Legacy Applications 2006
- [c24]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
- [c23]Ganesan Ramalingam, Raghavan Komondoor, John Field, Saurabh Sinha: Semantics-based reverse engineering of object-oriented data models. ICSE 2006: 192-201
- [c22]Stephen J. Fink, Eran Yahav, Nurit Dor, G. Ramalingam, Emmanuel Geay: Effective typestate verification in the presence of aliasing. ISSTA 2006: 133-144
- 2005
- [j14]John Field, Deepak Goyal, Ganesan Ramalingam, Eran Yahav: Typestate verification: Abstraction techniques and complexity results. Sci. Comput. Program. 58(1-2): 57-82 (2005)
- [c21]Raghavan Komondoor, Ganesan Ramalingam, Satish Chandra, John Field: Dependent Types for Program Understanding. TACAS 2005: 157-173
- [c20]Roman Manevich, Eran Yahav, Ganesan Ramalingam, Shmuel Sagiv: Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists. VMCAI 2005: 181-198
- [c19]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
- 2004
- [c18]Eran Yahav, G. Ramalingam: Verifying safety properties using separation and heterogeneous abstractions. PLDI 2004: 25-34
- [c17]Roman Manevich, Shmuel Sagiv, Ganesan Ramalingam, John Field: Partially Disjunctive Heap Abstraction. SAS 2004: 265-279
- 2003
- [c16]John Field, Deepak Goyal, G. Ramalingam, Eran Yahav: Typestate Verification: Abstraction Techniques and Complexity Results. SAS 2003: 439-462
- 2002
- [j13]
- [j12]G. Ramalingam: On loops, dominators, and dominance frontiers. ACM Trans. Program. Lang. Syst. 24(5): 455-490 (2002)
- [c15]G. Ramalingam, Alex Varshavsky, John Field, Deepak Goyal, Shmuel Sagiv: Deriving Specialized Program Analyses for Certifying Component-Client Conformance. PLDI 2002: 83-94
- [c14]Roman Manevich, G. Ramalingam, John Field, Deepak Goyal, Shmuel Sagiv: Compactly Representing First-Order Structures for Static Analysis. SAS 2002: 196-212
- 2000
- [j11]G. Ramalingam: Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Program. Lang. Syst. 22(2): 416-430 (2000)
- [c13]
1990 – 1999
- 1999
- [j10]G. Ramalingam, Junehwa Song, Leo Joskowicz, Raymond E. Miller: Solving Systems of Difference Constraints Incrementally. Algorithmica 23(3): 261-275 (1999)
- [j9]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)
- [j8]G. Ramalingam: Identifying Loops in Almost Linear Time. ACM Trans. Program. Lang. Syst. 21(2): 175-188 (1999)
- [c12]
- [c11]G. Ramalingam, John Field, Frank Tip: Aggregate Structure Identification and Its Application to Program Analysis. POPL 1999: 119-132
- 1997
- [c10]
- [c9]
- 1996
- [b1]G. Ramalingam: Bounded Incremental Computation. Lecture Notes in Computer Science 1089, Springer 1996, ISBN 3-540-61320-X
- [j7]G. Ramalingam, Thomas W. Reps: An Incremental Algorithm for a Generalization of the Shortest-Path Problem. J. Algorithms 21(2): 267-305 (1996)
- [j6]G. Ramalingam, Thomas W. Reps: On the Computational Complexity of Dynamic Graph Problems. Theor. Comput. Sci. 158(1&2): 233-277 (1996)
- [c8]Frank Tip, Jong-Deok Choi, John Field, G. Ramalingam: Slicing Class Hierarchies in C++. OOPSLA 1996: 179-197
- [c7]
- [c6]Junehwa Song, Michelle Y. Kim, G. Ramalingam, Raymond E. Miller, Byoung-Kee Yi: Interactive Authoring of Multimedia Documents. VL 1996: 276-283
- 1995
- [c5]
- 1994
- [j5]G. Ramalingam, Thomas W. Reps: On Competitive On-Line Algorithms for the Dynamic Priority-Ordering Problem. Inf. Process. Lett. 51(3): 155-161 (1994)
- [j4]G. Ramalingam: The Undecidability of Aliasing. ACM Trans. Program. Lang. Syst. 16(5): 1467-1471 (1994)
- [c4]G. Ramalingam, Thomas W. Reps: An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph. POPL 1994: 287-296
- 1993
- [c3]G. Ramalingam, Thomas W. Reps: A Categorized Bibliography on Incremental Computation. POPL 1993: 502-510
- 1991
- [c2]
- [c1]
- 1990
- [j3]G. Ramalingam, C. Pandu Rangan: New Sequential and Parallel Algorithms for Interval Graph Recognition. Inf. Process. Lett. 34(4): 215-219 (1990)
1980 – 1989
- 1988
- [j2]G. Ramalingam, C. Pandu Rangan: Total Domination in Interval Graphs Revisited. Inf. Process. Lett. 27(1): 17-21 (1988)
- [j1]G. Ramalingam, C. Pandu Rangan: A Unified Approach to Domination Problems on Interval Graphs. Inf. Process. Lett. 27(5): 271-274 (1988)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:24 CEST by the dblp team