| 2002 | ||
|---|---|---|
| j8 | C. R. Ramakrishnan, R. C. Sekar: Model-Based Analysis of Configuration Vulnerabilities. Journal of Computer Security 10(1/2): 189-209 (2002) | |
| 2001 | ||
| j7 | R. Ramesh, I. V. Ramakrishnan, R. C. Sekar: Automata-driven efficient subterm unification. Theor. Comput. Sci. 254(1-2): 187-223 (2001) | |
| p1 | I. V. Ramakrishnan, R. C. Sekar, Andrei Voronkov: Term Indexing. Handbook of Automated Reasoning 2001: 1853-1964 | |
| 1998 | ||
| c13 | Abhik Roychoudhury, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar: A Conservative Technique to Improve Deterministic Evaluation of Logic Programs. ICCL 1998: 196-205 | |
| 1997 | ||
| j6 | R. C. Sekar, I. V. Ramakrishnan, Prateek Mishra: On the power and limitations of strictness analysis. J. ACM 44(3): 505-525 (1997) | |
| j5 | Owen Kaser, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar: EQUALS - A Fast Parallel Implementation of a Lazy Language. J. Funct. Program. 7(2): 183-217 (1997) | |
| 1995 | ||
| j4 | R. C. Sekar, R. Ramesh, I. V. Ramakrishnan: Adaptive Pattern Matching. SIAM J. Comput. 24(6): 1207-1234 (1995) | |
| j3 | R. C. Sekar, I. V. Ramakrishnan: Fast Strictness Analysis Based on Demand Propagation. ACM Trans. Program. Lang. Syst. 17(6): 896-937 (1995) | |
| c12 | C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar: A Symbolic Constraint Solving Framework for Analysis of Logic Programs. PEPM 1995: 12-23 | |
| 1994 | ||
| c11 | R. C. Sekar, Yow-Jian Lin, C. R. Ramakrishnan: Modelling techniques for evolving distributed applications. FORTE 1994: 461-476 | |
| c10 | R. Ramesh, I. V. Ramakrishnan, R. C. Sekar: Automata-Driven Efficient Subterm Unification. FSTTCS 1994: 288-299 | |
| 1993 | ||
| j2 | A. Arango, Lisa Bahler, Peter Bates, Munir Cochinwala, David Cohrs, Robert Fish, Gita Gopal, Nancy D. Griffeth, Gary E. Herman, Takako M. Hickey, K. C. Lee, Will E. Leland, Carlyn Lowery, Victor Mak, John F. Patterson, Lillian Ruston, Mark Segal, R. C. Sekar, Mario P. Vecchi, Abel Weinrib, Sze-Ying Wuu: The Touring Machine System. Commun. ACM 36(1): 68-77 (1993) | |
| j1 | R. C. Sekar, I. V. Ramakrishnan: Programming in Equational Logic: Beyond Strong Sequentiality. Inf. Comput. 104(1): 78-109 (1993) | |
| c9 | Steven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar: Extracting Determinacy in Logic Programs. ICLP 1993: 424-438 | |
| 1992 | ||
| c8 | R. C. Sekar, I. V. Ramakrishnan: Programming with Equations: A Framework for Lazy Parallel Evaluation. CADE 1992: 618-632 | |
| c7 | ||
| c6 | Owen Kaser, Shaunak Pawagi, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar: Fast Parallel Implementation of Lazy Languages - The EQUALS Experience. LISP and Functional Programming 1992: 335-344 | |
| c5 | R. C. Sekar, Yow-Jian Lin, Sanjai Narain: On Modelling and Reasoning About Hybrid Systems. PSTV 1992: 115-129 | |
| 1991 | ||
| c4 | R. C. Sekar, Prateek Mishra, I. V. Ramakrishnan: On the Power and Limitation of Strictness Analysis Based on Abstract Interpretation. POPL 1991: 37-48 | |
| 1990 | ||
| c3 | R. C. Sekar, I. V. Ramakrishnan: Programming in Equational Logic: Beyond Strong Sequentiality. LICS 1990: 230-241 | |
| c2 | R. C. Sekar, Shaunak Pawagi, I. V. Ramakrishnan: Small Domains Spell Fast Strictness Analysis. POPL 1990: 169-183 | |
| 1989 | ||
| c1 | R. C. Sekar, Shaunak Pawagi, I. V. Ramakrishnan: Transforming Strongly Sequential Rewrite Systems with Constructors for Efficient parallel Execution. RTA 1989: 404-418 | |
Data released under the ODC-BY 1.0 license — See also our legal information page