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