The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

G. Ramalingam: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. G. Ramalingam, Thomas W. Reps
    A Categorized Bibliography on Incremental Computation. [Citation Graph (1, 0)][DBLP]
    POPL, 1993, pp:502-510 [Conf]
  2. G. Ramalingam, Thomas W. Reps
    Modification Algebras. [Citation Graph (0, 0)][DBLP]
    AMAST, 1991, pp:547-558 [Conf]
  3. Stephen J. Fink, Eran Yahav, Nurit Dor, G. Ramalingam, Emmanuel Geay
    Effective typestate verification in the presence of aliasing. [Citation Graph (0, 0)][DBLP]
    ISSTA, 2006, pp:133-144 [Conf]
  4. Frank Tip, Jong-Deok Choi, John Field, G. Ramalingam
    Slicing Class Hierarchies in C++. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 1996, pp:179-197 [Conf]
  5. John Field, G. Ramalingam
    Identifying Procedural Structure in Cobol Programs. [Citation Graph (0, 0)][DBLP]
    PASTE, 1999, pp:1-10 [Conf]
  6. G. Ramalingam
    On loops, dominators, and dominance frontier. [Citation Graph (0, 0)][DBLP]
    PLDI, 2000, pp:233-241 [Conf]
  7. G. Ramalingam
    Data Flow Frequency Analysis. [Citation Graph (0, 0)][DBLP]
    PLDI, 1996, pp:267-277 [Conf]
  8. G. Ramalingam, Harini Srinivasan
    A Member Lookup Algorithm for C++. [Citation Graph (0, 0)][DBLP]
    PLDI, 1997, pp:18-30 [Conf]
  9. G. Ramalingam, Alex Varshavsky, John Field, Deepak Goyal, Shmuel Sagiv
    Deriving Specialized Program Analyses for Certifying Component-Client Conformance. [Citation Graph (0, 0)][DBLP]
    PLDI, 2002, pp:83-94 [Conf]
  10. Eran Yahav, G. Ramalingam
    Verifying safety properties using separation and heterogeneous abstractions. [Citation Graph (0, 0)][DBLP]
    PLDI, 2004, pp:25-34 [Conf]
  11. John Field, G. Ramalingam, Frank Tip
    Parametric Program Slicing. [Citation Graph (0, 0)][DBLP]
    POPL, 1995, pp:379-392 [Conf]
  12. G. Ramalingam, John Field, Frank Tip
    Aggregate Structure Identification and Its Application to Program Analysis. [Citation Graph (0, 0)][DBLP]
    POPL, 1999, pp:119-132 [Conf]
  13. G. Ramalingam, Thomas W. Reps
    An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph. [Citation Graph (0, 0)][DBLP]
    POPL, 1994, pp:287-296 [Conf]
  14. John Field, Deepak Goyal, G. Ramalingam, Eran Yahav
    Typestate Verification: Abstraction Techniques and Complexity Results. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:439-462 [Conf]
  15. Roman Manevich, G. Ramalingam, John Field, Deepak Goyal, Shmuel Sagiv
    Compactly Representing First-Order Structures for Static Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 2002, pp:196-212 [Conf]
  16. G. Ramalingam
    On Sparse Evaluation Representations. [Citation Graph (0, 0)][DBLP]
    SAS, 1997, pp:1-15 [Conf]
  17. G. Ramalingam, Thomas W. Reps
    A Theory of Program Modifications. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.2, 1991, pp:137-152 [Conf]
  18. Junehwa Song, Michelle Y. Kim, G. Ramalingam, Raymond E. Miller, Byoung-Kee Yi
    Interactive Authoring of Multimedia Documents. [Citation Graph (0, 0)][DBLP]
    VL, 1996, pp:276-283 [Conf]
  19. G. Ramalingam, Junehwa Song, Leo Joskowicz, Raymond E. Miller
    Solving Systems of Difference Constraints Incrementally. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:23, n:3, pp:261-275 [Journal]
  20. G. Ramalingam, C. Pandu Rangan
    Total Domination in Interval Graphs Revisited. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:1, pp:17-21 [Journal]
  21. G. Ramalingam, C. Pandu Rangan
    A Unified Approach to Domination Problems on Interval Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:5, pp:271-274 [Journal]
  22. G. Ramalingam, C. Pandu Rangan
    New Sequential and Parallel Algorithms for Interval Graph Recognition. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:4, pp:215-219 [Journal]
  23. G. Ramalingam, Thomas W. Reps
    On Competitive On-Line Algorithms for the Dynamic Priority-Ordering Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:3, pp:155-161 [Journal]
  24. G. Ramalingam, Thomas W. Reps
    An Incremental Algorithm for a Generalization of the Shortest-Path Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:2, pp:267-305 [Journal]
  25. Junehwa Song, G. Ramalingam, Raymond E. Miller, Byoung-Kee Yi
    Interactive Authoring of Multimedia Documents in a Constraint-Based Authoring System. [Citation Graph (0, 0)][DBLP]
    Multimedia Syst., 1999, v:7, n:5, pp:424-437 [Journal]
  26. G. Ramalingam
    On sparse evaluation representations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:277, n:1-2, pp:119-147 [Journal]
  27. G. Ramalingam, Thomas W. Reps
    On the Computational Complexity of Dynamic Graph Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:158, n:1&2, pp:233-277 [Journal]
  28. G. Ramalingam
    Context-sensitive synchronization-sensitive analysis is undecidable. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2000, v:22, n:2, pp:416-430 [Journal]
  29. G. Ramalingam
    On loops, dominators, and dominance frontiers. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2002, v:24, n:5, pp:455-490 [Journal]
  30. G. Ramalingam
    The Undecidability of Aliasing. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1994, v:16, n:5, pp:1467-1471 [Journal]
  31. G. Ramalingam
    Identifying Loops in Almost Linear Time. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1999, v:21, n:2, pp:175-188 [Journal]
  32. Roman Manevich, John Field, Thomas A. Henzinger, G. Ramalingam, Mooly Sagiv
    Abstract Counterexample-Based Refinement for Powerset Domains. [Citation Graph (0, 0)][DBLP]
    Program Analysis and Compilation, 2006, pp:273-292 [Conf]
  33. Roman Manevich, Josh Berdine, Byron Cook, G. Ramalingam, Mooly Sagiv
    Shape Analysis by Graph Decomposition. [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:3-18 [Conf]

  34. ISOLATOR: dynamically ensuring isolation in comcurrent programs. [Citation Graph (, )][DBLP]


  35. Thread Quantification for Concurrent Shape Analysis. [Citation Graph (, )][DBLP]


  36. EON: modeling and analyzing dynamic access control systems with logic programs. [Citation Graph (, )][DBLP]


  37. Logical Concurrency Control from Sequential Proofs. [Citation Graph (, )][DBLP]


  38. Sequential verification of serializability. [Citation Graph (, )][DBLP]


  39. Recovering Data Models via Guarded Dependences. [Citation Graph (, )][DBLP]


  40. Parametric Process Model Inference. [Citation Graph (, )][DBLP]


  41. Automatic Verification of Strongly Dynamic Software Systems. [Citation Graph (, )][DBLP]


Search in 0.140secs, Finished in 0.142secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002