The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
C. R. Ramakrishnan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hasan Davulcu, Michael Kifer, C. R. Ramakrishnan, I. V. Ramakrishnan
    Logic Based Modeling and Analysis of Workflows. [Citation Graph (2, 17)][DBLP]
    PODS, 1998, pp:25-33 [Conf]
  2. Hasan Davulcu, Michael Kifer, L. Robert Pokorny, C. R. Ramakrishnan, I. V. Ramakrishnan, Steven Dawson
    Modeling and Analysis of Interactions in Virtual Enterprises. [Citation Graph (1, 0)][DBLP]
    RIDE, 1999, pp:12-18 [Conf]
  3. Yifei Dong, Beata Sarna-Starosta, C. R. Ramakrishnan, Scott A. Smolka
    Vacuity Checking in the Modal Mu-Calculus. [Citation Graph (0, 0)][DBLP]
    AMAST, 2002, pp:147-162 [Conf]
  4. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan
    Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1999, pp:322-333 [Conf]
  5. Leo Bachmair, Ta Chen, C. R. Ramakrishnan, I. V. Ramakrishnan
    Subsumption Algorithms Based on Search Trees. [Citation Graph (0, 0)][DBLP]
    CAAP, 1996, pp:135-148 [Conf]
  6. Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka
    Evidence Explorer: A Tool for Exploring Model-Checking Proofs. [Citation Graph (0, 0)][DBLP]
    CAV, 2003, pp:215-218 [Conf]
  7. Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka, Terrance Swift, David Scott Warren
    Efficient Model Checking Using Tabled Resolution. [Citation Graph (0, 0)][DBLP]
    CAV, 1997, pp:143-154 [Conf]
  8. C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka, Yifei Dong, Xiaoqun Du, Abhik Roychoudhury, V. N. Venkatakrishnan
    XMC: A Logic-Programming-Based Verification Toolset. [Citation Graph (0, 0)][DBLP]
    CAV, 2000, pp:576-580 [Conf]
  9. C. R. Ramakrishnan
    Verification Using Tabled Logic Programming. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2000, pp:89-91 [Conf]
  10. Amit Sasturkar, Ping Yang, Scott D. Stoller, C. R. Ramakrishnan
    Policy Analysis for Administrative Role Based Access Control. [Citation Graph (0, 0)][DBLP]
    CSFW, 2006, pp:124-138 [Conf]
  11. L. Robert Pokorny, C. R. Ramakrishnan
    Modeling and Verification of Distributed Autonomous Agents Using Logic Programming. [Citation Graph (0, 0)][DBLP]
    DALT, 2004, pp:148-165 [Conf]
  12. Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka
    Model Checking and Evidence Exploration. [Citation Graph (0, 0)][DBLP]
    ECBS, 2003, pp:214-223 [Conf]
  13. Giridhar Pemmasani, Hai-Feng Guo, Yifei Dong, C. R. Ramakrishnan, I. V. Ramakrishnan
    Online Justification for Tabled Logic Programs. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2004, pp:24-38 [Conf]
  14. Ernie Johnson, C. R. Ramakrishnan, I. V. Ramakrishnan, Prasad Rao
    A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    Fuji International Symposium on Functional and Logic Programming, 1999, pp:284-300 [Conf]
  15. Yifei Dong, C. R. Ramakrishnan
    An Optimizing Compiler for Efficient Model Checking. [Citation Graph (0, 0)][DBLP]
    FORTE, 1999, pp:241-256 [Conf]
  16. R. C. Sekar, Yow-Jian Lin, C. R. Ramakrishnan
    Modelling techniques for evolving distributed applications. [Citation Graph (0, 0)][DBLP]
    FORTE, 1994, pp:461-476 [Conf]
  17. Abhik Roychoudhury, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar
    A Conservative Technique to Improve Deterministic Evaluation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICCL, 1998, pp:196-205 [Conf]
  18. Beata Sarna-Starosta, C. R. Ramakrishnan
    Constraint-Based Model Checking of Data-Independent Systems. [Citation Graph (0, 0)][DBLP]
    ICFEM, 2003, pp:579-598 [Conf]
  19. Samik Basu, Madhavan Mukund, C. R. Ramakrishnan, I. V. Ramakrishnan, Rakesh M. Verma
    Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 2001, pp:166-180 [Conf]
  20. Steven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar
    Extracting Determinacy in Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1993, pp:424-438 [Conf]
  21. Hai-Feng Guo, C. R. Ramakrishnan, I. V. Ramakrishnan
    Speculative Beats Conservative Justification. [Citation Graph (0, 0)][DBLP]
    ICLP, 2001, pp:150-165 [Conf]
  22. K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smolka
    Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models. [Citation Graph (0, 0)][DBLP]
    ICLP, 2001, pp:227-241 [Conf]
  23. Giridhar Pemmasani, Hai-Feng Guo, Yifei Dong, C. R. Ramakrishnan, I. V. Ramakrishnan
    Online Justification for Tabled Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 2003, pp:500-501 [Conf]
  24. Giridhar Pemmasani, C. R. Ramakrishnan, I. V. Ramakrishnan
    Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints. [Citation Graph (0, 0)][DBLP]
    ICLP, 2002, pp:100-114 [Conf]
  25. Diptikalyan Saha, C. R. Ramakrishnan
    Incremental Evaluation of Tabled Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 2003, pp:392-406 [Conf]
  26. Diptikalyan Saha, C. R. Ramakrishnan
    Symbolic Support Graph: A Space Efficient Data Structure for Incremental Tabled Evaluation. [Citation Graph (0, 0)][DBLP]
    ICLP, 2005, pp:235-249 [Conf]
  27. Diptikalyan Saha, C. R. Ramakrishnan
    A Local Algorithm for Incremental Evaluation of Tabled Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 2006, pp:56-71 [Conf]
  28. C. R. Ramakrishnan, I. V. Ramakrishnan, David Scott Warren
    Deductive Spreadsheets Using Tabled Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 2006, pp:391-405 [Conf]
  29. Prasad Rao, C. R. Ramakrishnan, I. V. Ramakrishnan
    A Thread in Time Saves Tabling Time. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1996, pp:112-126 [Conf]
  30. Prasad Rao, C. R. Ramakrishnan, I. V. Ramakrishnan
    On the Optimality of Scheduling Strategies in Subsumption-based Tabled Resolution. [Citation Graph (0, 0)][DBLP]
    IJCSLP, 1998, pp:310-324 [Conf]
  31. Owen Kaser, Shaunak Pawagi, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar
    Fast Parallel Implementation of Lazy Languages - The EQUALS Experience. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1992, pp:335-344 [Conf]
  32. Hai-Feng Guo, C. R. Ramakrishnan, I. V. Ramakrishnan
    Justification Based on Program Transformation. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2002, pp:158-159 [Conf]
  33. Abhik Roychoudhury, C. R. Ramakrishnan
    Unfold/Fold Transformations for Automated Verification of Parameterized Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    Program Development in Computational Logic, 2004, pp:261-290 [Conf]
  34. R. Sekar, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka
    Model-Carrying Code (MCC): a new paradigm for mobile-code security. [Citation Graph (0, 0)][DBLP]
    NSPW, 2001, pp:23-30 [Conf]
  35. Diptikalyan Saha, C. R. Ramakrishnan
    Incremental Evaluation of Tabled Prolog: Beyond Pure Logic Programs. [Citation Graph (0, 0)][DBLP]
    PADL, 2006, pp:215-229 [Conf]
  36. C. R. Ramakrishnan
    A Model Checker for Value-Passing Mu-Calculus Using Logic Programming. [Citation Graph (0, 0)][DBLP]
    PADL, 2001, pp:1-13 [Conf]
  37. Ping Yang, Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka
    A Provably Correct Compiler for Efficient Model Checking of Mobile Processes. [Citation Graph (0, 0)][DBLP]
    PADL, 2005, pp:113-127 [Conf]
  38. Beata Sarna-Starosta, C. R. Ramakrishnan
    Compiling Constraint Handling Rules for Efficient Tabled Evaluation. [Citation Graph (0, 0)][DBLP]
    PADL, 2007, pp:170-184 [Conf]
  39. C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar
    A Symbolic Constraint Solving Framework for Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    PEPM, 1995, pp:12-23 [Conf]
  40. Steven Dawson, C. R. Ramakrishnan, David Scott Warren
    Practical Program Analysis Using General Purpose Logic Programming Systems - A Case Study. [Citation Graph (0, 0)][DBLP]
    PLDI, 1996, pp:117-126 [Conf]
  41. Baoqiu Cui, Yifei Dong, Xiaoqun Du, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan, Abhik Roychoudhury, Scott A. Smolka, David Scott Warren
    Logic Programming and Model Checking. [Citation Graph (0, 0)][DBLP]
    PLILP/ALP, 1998, pp:1-20 [Conf]
  42. Steven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan
    Design and Implementation of Jump Tables for Fast Indexing of Logic Programs [Citation Graph (0, 0)][DBLP]
    PLILP, 1995, pp:133-150 [Conf]
  43. Steven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, Konstantinos F. Sagonas, Steven Skiena, Terrance Swift, David Scott Warren
    Unification Factoring for Efficient Execution of Logic Programs. [Citation Graph (0, 0)][DBLP]
    POPL, 1995, pp:247-258 [Conf]
  44. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan
    A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs. [Citation Graph (0, 0)][DBLP]
    PPDP, 1999, pp:396-413 [Conf]
  45. Abhik Roychoudhury, C. R. Ramakrishnan, I. V. Ramakrishnan
    Justifying proofs using memo tables. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:178-189 [Conf]
  46. Diptikalyan Saha, C. R. Ramakrishnan
    Incremental and demand-driven points-to analysis using logic programming. [Citation Graph (0, 0)][DBLP]
    PPDP, 2005, pp:117-128 [Conf]
  47. Leo Bachmair, C. R. Ramakrishnan, I. V. Ramakrishnan, Ashish Tiwari
    Normalization via Rewrite Closures. [Citation Graph (0, 0)][DBLP]
    RTA, 1999, pp:190-204 [Conf]
  48. Steven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, Terrance Swift
    Optimizing Clause Resolution: Beyond Unification Factoring. [Citation Graph (0, 0)][DBLP]
    ILPS, 1995, pp:194-208 [Conf]
  49. Samik Basu, K. Narayan Kumar, L. Robert Pokorny, C. R. Ramakrishnan
    Resource-Constrained Model Checking of Recursive Programs. [Citation Graph (0, 0)][DBLP]
    TACAS, 2002, pp:236-250 [Conf]
  50. Samik Basu, C. R. Ramakrishnan
    Compositional Analysis for Verification of Parameterized Systems. [Citation Graph (0, 0)][DBLP]
    TACAS, 2003, pp:315-330 [Conf]
  51. Yifei Dong, Xiaoqun Du, Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka, Oleg Sokolsky, Eugene W. Stark, David Scott Warren
    Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools. [Citation Graph (0, 0)][DBLP]
    TACAS, 1999, pp:74-88 [Conf]
  52. Xinxin Liu, C. R. Ramakrishnan, Scott A. Smolka
    Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TACAS, 1998, pp:5-19 [Conf]
  53. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka
    Verification of Parameterized Systems Using Logic Program Transformations. [Citation Graph (0, 0)][DBLP]
    TACAS, 2000, pp:172-187 [Conf]
  54. Ping Yang, Samik Basu, C. R. Ramakrishnan
    Parameterized Verification of pi-Calculus Systems. [Citation Graph (0, 0)][DBLP]
    TACAS, 2006, pp:42-57 [Conf]
  55. Abhik Roychoudhury, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka
    Tabulation-based Induction Proofs with Application to Automated Verification. [Citation Graph (0, 0)][DBLP]
    TAPD, 1998, pp:83-88 [Conf]
  56. Ping Yang, C. R. Ramakrishnan, Scott A. Smolka
    A Logical Encoding of the pi-Calculus: Model Checking Mobile Processes Using Tabled Resolution. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2003, pp:116-131 [Conf]
  57. Owen Kaser, C. R. Ramakrishnan
    Evaluating Inlining Techniques. [Citation Graph (0, 0)][DBLP]
    Comput. Lang., 1998, v:24, n:2, pp:55-72 [Journal]
  58. Xiaoqun Du, C. R. Ramakrishnan, Scott A. Smolka
    Real-Time Verification Techniques for Untimed Systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:39, n:3, pp:- [Journal]
  59. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan
    Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:3, pp:387-403 [Journal]
  60. Hai-Feng Guo, Miao Liu, Partha S. Roop, C. R. Ramakrishnan, I. V. Ramakrishnan
    Precise specification matching for adaptive reuse in embedded systems. [Citation Graph (0, 0)][DBLP]
    J. Applied Logic, 2007, v:5, n:2, pp:333-355 [Journal]
  61. C. R. Ramakrishnan, R. C. Sekar
    Model-Based Analysis of Configuration Vulnerabilities. [Citation Graph (0, 0)][DBLP]
    Journal of Computer Security, 2002, v:10, n:1/2, pp:189-209 [Journal]
  62. Owen Kaser, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar
    EQUALS - A Fast Parallel Implementation of a Lazy Language. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1997, v:7, n:2, pp:183-217 [Journal]
  63. Owen Kaser, C. R. Ramakrishnan, Shaunak Pawagi
    On the Conversion of Indirect to Direct Recursion. [Citation Graph (0, 0)][DBLP]
    LOPLAS, 1993, v:2, n:1-4, pp:151-164 [Journal]
  64. Ping Yang, C. R. Ramakrishnan, Scott A. Smolka
    A logical encoding of the pi-calculus: model checking mobile processes using tabled resolution. [Citation Graph (0, 0)][DBLP]
    STTT, 2004, v:6, n:1, pp:38-66 [Journal]
  65. Samik Basu, C. R. Ramakrishnan
    Compositional analysis for verification of parameterized systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:354, n:2, pp:211-229 [Journal]
  66. Steven Dawson, C. R. Ramakrishnan, Steven Skiena, Terrance Swift
    Principles and Practice of Unification Factoring. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1996, v:18, n:5, pp:528-563 [Journal]
  67. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan
    An unfold/fold transformation framework for definite logic programs. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2004, v:26, n:3, pp:464-509 [Journal]
  68. Michael Leuschel, Andreas Podelski, C. R. Ramakrishnan, Ulrich Ultes-Nitsche
    Introduction to the Special Issue on Verification and Computational Logic. [Citation Graph (0, 0)][DBLP]
    TPLP, 2004, v:4, n:5-6, pp:543-544 [Journal]

  69. Efficient policy analysis for administrative role based access control. [Citation Graph (, )][DBLP]


  70. Security policy analysis using deductive spreadsheets. [Citation Graph (, )][DBLP]


  71. Query-Based Model Checking of Ad Hoc Network Protocols. [Citation Graph (, )][DBLP]


  72. A Process Calculus for Mobile Ad Hoc Networks. [Citation Graph (, )][DBLP]


  73. Power Optimization in Fault-Tolerant Mobile Ad Hoc Networks. [Citation Graph (, )][DBLP]


  74. Tabled Resolution + Constraints: A Recipe for Model Checking Real-Time Systems. [Citation Graph (, )][DBLP]


  75. Symbolic reachability analysis for parameterized administrative role based access control. [Citation Graph (, )][DBLP]


  76. A methodology for in-network evaluation of integrated logical-statistical models. [Citation Graph (, )][DBLP]


  77. Automated construction of web accessibility models from transaction click-streams. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.011secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002