| Year |
Citation |
Score |
| 2019 |
Ghosh S, Ramakrishnan CR. Value of Information in Probabilistic Logic Programs Arxiv: Artificial Intelligence. 306: 71-84. DOI: 10.4204/Eptcs.306.14 |
0.356 |
|
| 2016 |
Bartocci E, Ramakrishnan CR. Preface of the special issue on Model Checking of Software: Selected papers of the 20th International SPIN Symposium on Model Checking of Software International Journal On Software Tools For Technology Transfer. 1-3. DOI: 10.1007/S10009-016-0414-5 |
0.378 |
|
| 2015 |
Nampally A, Ramakrishnan CR. Constraint-based inference in probabilistic logic programs Ceur Workshop Proceedings. 1413: 46-56. |
0.349 |
|
| 2012 |
Gorlin A, Ramakrishnan CR, Smolka SA. Model checking with probabilistic tabled logic programming Theory and Practice of Logic Programming. 12: 681-700. DOI: 10.1017/S1471068412000245 |
0.488 |
|
| 2012 |
Islam MA, Ramakrishnan CR, Ramakrishnan IV. Inference in probabilistic logic programs with continuous random variables Theory and Practice of Logic Programming. 12: 505-523. DOI: 10.1017/S1471068412000154 |
0.798 |
|
| 2011 |
Sasturkar A, Yang P, Stoller SD, Ramakrishnan CR. Policy analysis for Administrative Role-Based Access Control Theoretical Computer Science. 412: 6208-6234. DOI: 10.1016/J.Tcs.2011.05.009 |
0.39 |
|
| 2011 |
Stoller SD, Yang P, Gofman MI, Ramakrishnan CR. Symbolic reachability analysis for parameterized administrative role-based access control Computers and Security. 30: 148-164. DOI: 10.1016/J.Cose.2010.08.002 |
0.397 |
|
| 2010 |
Singh A, Ramakrishnan CR, Smolka SA. A process calculus for Mobile Ad Hoc Networks Science of Computer Programming. 75: 440-469. DOI: 10.1016/J.Scico.2009.07.008 |
0.54 |
|
| 2009 |
Mahmud J, Borodin Y, Ramakrishnan IV, Ramakrishnan CR. Automated construction of web accessibility models from transaction click-streams Www'09 - Proceedings of the 18th International World Wide Web Conference. 871-880. DOI: 10.1145/1526709.1526826 |
0.75 |
|
| 2008 |
Singh A, Ramakrishnan CR, Ramakrishnan IV, Warren DS, Wong JL. A methodology for in-network evaluation of integrated logical-statistical models Sensys'08 - Proceedings of the 6th Acm Conference On Embedded Networked Sensor Systems. 197-210. DOI: 10.1145/1460412.1460432 |
0.672 |
|
| 2007 |
Singh A, Ramakrishnan CR, Ramakrishnan IV, Stoller SD, Warren DS. Security policy analysis using deductive spreadsheets Fmse'07 - Proceedings of the 2007 Acm Workshop On Formal Methods in Security Engineering. 42-50. DOI: 10.1145/1314436.1314443 |
0.633 |
|
| 2007 |
Ramakrishnan CR, Ramakrishnan IV, Warren DS. XcelLog: A deductive spreadsheet system Knowledge Engineering Review. 22: 269-279. DOI: 10.1017/S026988890700118X |
0.719 |
|
| 2007 |
Guo HF, Liu M, Roop PS, Ramakrishnan CR, Ramakrishnan IV. Precise specification matching for adaptive reuse in embedded systems Journal of Applied Logic. 5: 333-355. DOI: 10.1016/J.Jal.2005.12.016 |
0.691 |
|
| 2007 |
Sarna-Starosta B, Ramakrishnan CR. Compiling constraint handling rules for efficient tabled evaluation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4354: 170-184. DOI: 10.1007/978-3-540-69611-7-11 |
0.824 |
|
| 2006 |
Basu S, Ramakrishnan CR. Compositional analysis for verification of parameterized systems Theoretical Computer Science. 354: 211-229. DOI: 10.1016/J.Tcs.2005.11.016 |
0.756 |
|
| 2006 |
Ramakrishnan CR, Ramakrishnan IV, Warren DS. Deductive spreadsheets using tabled logic programming Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4079: 391-405. |
0.719 |
|
| 2006 |
Yang P, Basu S, Ramakrishnan CR. Parameterized verification of π-calculus systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3920: 42-47. |
0.311 |
|
| 2005 |
Saha D, Ramakrishnan CR. Incremental evaluation of tabled prolog: Beyond pure logic programs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3819: 215-229. DOI: 10.1007/11603023_15 |
0.347 |
|
| 2005 |
Pokorny LR, Ramakrishnan CR. Modeling and verification of distributed autonomous agents using logic programming Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3476: 148-165. |
0.787 |
|
| 2005 |
Saha D, Ramakrishnan CR. Incremental and demand-driven points-to analysis using logic programming Ppdp'05 - Proceedings of the Seventh Acm Sigplan Conference On Principles and Practice of Declarative Programming. 2005: 117-128. |
0.351 |
|
| 2005 |
Yang P, Dong Y, Ramakrishnan CR, Smolka SA. A provably correct compiler for efficient model checking of mobile processes Lecture Notes in Computer Science. 3350: 113-127. |
0.329 |
|
| 2005 |
Saha D, Ramakrishnan CR. Symbolic support graph: A space efficient data structure for incremental tabled evaluation Lecture Notes in Computer Science. 3668: 235-249. |
0.306 |
|
| 2004 |
Roychoudhury A, Kumar KN, Ramakrishnan CR, Ramakrishnan IV. An unfold/fold transformation framework for definite logic programs Acm Transactions On Programming Languages and Systems. 26: 464-509. DOI: 10.1145/982158.982160 |
0.773 |
|
| 2004 |
Leuschel M, Podelski A, Ramakrishnan CR, Ultes-nitsche U. Introduction to the special issue on Verification and Computational Logic Theory and Practice of Logic Programming. 4: 543-544. DOI: 10.1017/S1471068404002078 |
0.53 |
|
| 2004 |
Yang P, Ramakrishnan CR, Smolka SA. A logical encoding of the π-calculus: Model checking mobile processes using tabled resolution International Journal On Software Tools For Technology Transfer. 6: 38-66. DOI: 10.1007/S10009-003-0136-3 |
0.576 |
|
| 2004 |
Roychoudhury A, Ramakrishnan CR. Unfold/fold transformations for automated verification of parameterized concurrent systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3049: 261-290. DOI: 10.1007/978-3-540-25951-0_9 |
0.674 |
|
| 2004 |
Pemmasani G, Guo HF, Dong Y, Ramakrishnan CR, Ramakrishnan IV. Online justification for tabled logic programs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2998: 24-38. DOI: 10.1007/978-3-540-24599-5_42 |
0.787 |
|
| 2003 |
Saha D, Ramakrishnan CR. Incremental evaluation of tabled logic programs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2916: 392-406. DOI: 10.1007/978-3-540-24599-5_27 |
0.346 |
|
| 2003 |
Guo HF, Ramakrishnan CR, Ramakrishnan IV. Justification based on program transformation (extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2664: 158-159. |
0.708 |
|
| 2003 |
Sarna-Starosta B, Ramakrishnan CR. Constraint-Based model checking of data-independent systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2885: 579-598. |
0.804 |
|
| 2002 |
Ramakrishnan CR, Sekar R. Model-based analysis of configuration vulnerabilities Journal of Computer Security. 10: 189-209. DOI: 10.3233/Jcs-2002-101-209 |
0.437 |
|
| 2002 |
Roychoudhury A, Narayan Kumar K, Ramakrishnan CR, Ramakrishnan IV. Beyond tamaki-sato style unfold/fold transformations for normal logic programs International Journal of Foundations of Computer Science. 13: 387-403. DOI: 10.1142/S0129054102001175 |
0.781 |
|
| 2002 |
Basu S, Kumar KN, Pokorny LR, Ramakrishnan CR. Resource-constrained model checking of recursive programs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2280: 236-250. |
0.788 |
|
| 2002 |
Pemmasani G, Ramakrishnan CR, Ramakrishnan IV. Efficient real-time model checking using tabled logic programming and constraints Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2401: 100-114. |
0.79 |
|
| 2002 |
Dong Y, Sarna-Starosta B, Ramakrishnan CR, Smolka SA. Vacuity checking in the modal mu-calculus Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2422: 147-162. |
0.792 |
|
| 2001 |
Leuschel M, Podelski A, Ramakrishnan CR, Ultes-Nitsche U. Call for Papers: Verification and Computational Logic / Special Issue of Theory and Practice of Logic Programming Theory and Practice of Logic Programming. 1: 631-632. DOI: 10.1017/S1471068401001089 |
0.41 |
|
| 2001 |
Guo HF, Ramakrishnan CR, Ramakrishnan IV. Speculative beats conservative justification Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2237: 150-165. |
0.741 |
|
| 2001 |
Sekar R, Ramakrishnan CR, Ramakrishnan IV, Smolka SA. Model-carrying code (MCC): A new paradigm for mobile-code security Proceedings New Security Paradigms Workshop. 23-30. |
0.643 |
|
| 2001 |
Ramakrishnan CR. A model checker for value-passing mu-calculus using logic programming Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1990: 1-13. |
0.416 |
|
| 2001 |
Narayan Kumar K, Ramakrishnan CR, Smolka SA. Alternating fixed points in Boolean equation systems as preferred stable models Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2237: 227-241. |
0.324 |
|
| 2001 |
Basu S, Mukund M, Ramakrishnan CR, Ramakrishnan IV, Verma R. Local and symbolic bisimulation using tabled constraint logic programming Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2237: 166-180. |
0.729 |
|
| 2000 |
Ramakrishnan CR, Ramakrishnan IV, Smolka SA, Warren DS. Specification and evaluation of logic-based model checking Acm Sigsoft Software Engineering Notes. 25: 73-74. DOI: 10.1145/340855.340997 |
0.718 |
|
| 2000 |
Ramakrishnan CR. Tabled logic programming for verification and program analysis Acm Sigsoft Software Engineering Notes. 25: 73. DOI: 10.1145/340855.340996 |
0.429 |
|
| 2000 |
Du X, Ramakrishnan CR, Smolka SA. Real-time verification techniques for untimed systems Electronic Notes in Theoretical Computer Science. 39: 258-272. DOI: 10.1016/S1571-0661(05)80751-0 |
0.645 |
|
| 2000 |
Roychoudhury A, Ramakrishnan CR, Ramakrishnan IV. Justifying proofs using memo tables Proceedings of the 2nd International Acm Sigplan Conference On Principles and Practice of Declarative Programming. 178-189. |
0.67 |
|
| 2000 |
Ramakrishnan CR, Ramakrishnan IV, Smolka SA, Dong Y, Du X, Roychoudhury A, Venkatakrishnan VN. XMC: A logic-programming-based verification toolset Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1855: 576-580. |
0.722 |
|
| 2000 |
Roychoudhury A, Kumar KN, Ramakrishnan CR, Ramakrishnan IV, Smolka SA. Verification of parameterized systems using logic program transformations Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1785: 172-187. |
0.741 |
|
| 2000 |
Ramakrishnan CR. Verification using tabled logic programming Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1877: 89-91. |
0.431 |
|
| 1999 |
Ramakrishnan CR, Silva CT. Optimal processor allocation for sort-last compositing under BSP-tree ordering Proceedings of Spie - the International Society For Optical Engineering. 3643: 182-192. DOI: 10.1117/12.342834 |
0.315 |
|
| 1999 |
Bachmair L, Ramakrishnan CR, Ramakrishnan IV, Tiwari A. Normalization via rewrite closures Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1631: 190-204. DOI: 10.1007/3-540-48685-2_15 |
0.672 |
|
| 1999 |
Davulcu H, Kifer M, Pokorny LR, Ramakrishnan CR, Ramakrishnan IV, Dawson S. Modeling and analysis of interactions in virtual enterprises Proceedings of the Ieee International Workshop On Research Issues in Data Engineering. 12-18. |
0.743 |
|
| 1999 |
Johnson E, Ramakrishnan CR, Ramakrishnan IV, Rao P. A space efficient engine for subsumption-based tabled evaluation of logic programs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1722: 284-299. |
0.691 |
|
| 1999 |
Dong Y, Du X, Ramakrishna YS, Ramakrishnan CR, Ramakrishnan IV, Smolka SA, Sokolsky O, Stark EW, Warren DS. Fighting livelock in the i-protocol: A comparative study of verification tools Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1579: 74-88. |
0.677 |
|
| 1998 |
Roychoudhury A, Ramakrishnan CR, Ramakrishnan IV, Sekar R. Conservative technique to improve deterministic evaluation of logic programs Proceedings of the Ieee International Conference On Computer Languages. 196-205. DOI: 10.1109/ICCL.1998.674170 |
0.726 |
|
| 1998 |
Cui B, Dong Y, Du X, Kumar KN, Ramakrishnan CR, Ramakrishnan IV, Roychoudhury A, Smolka SA, Warren DS. Logic programming and model checking Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1490: 1-20. DOI: 10.1007/Bfb0056604 |
0.822 |
|
| 1998 |
Davulcu H, Kifer M, Ramakrishnan CR, Ramakrishnan IV. Logic based modeling and analysis of workflows Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 25-33. |
0.705 |
|
| 1997 |
Kaser O, Ramakrishnan CR, Ramakrishnan IV, Sekar RC. E QUALS – a fast parallel implementation of a lazy language Journal of Functional Programming. 7: 183-217. DOI: 10.1017/S0956796897002669 |
0.708 |
|
| 1997 |
Ramakrishna YS, Ramakrishnan CR, Ramakrishnan IV, Smolka SA, Swift T, Warren DS. Efficient model checking using tabled resolution Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1254: 143-154. |
0.736 |
|
| 1997 |
Kaser O, Ramakrishnan CR, Ramakrishnan IV, Sekar RC. Equals - A fast parallel implementation of a lazy language Journal of Functional Programming. 7: 183-217. |
0.687 |
|
| 1996 |
Dawson S, Ramakrishnan CR, Skiena S, Swift T. Principles and Practice of Unification Factoring Acm Transactions On Programming Languages and Systems. 18: 528-563. DOI: 10.1145/232706.232722 |
0.437 |
|
| 1996 |
Dawson S, Ramakrishnan CR, Warren DS. Practical program analysis using general purpose logic programming systems - A case study Sigplan Notices (Acm Special Interest Group On Programming Languages). 31: 117-126. |
0.398 |
|
| 1996 |
Bachmair L, Chen T, Ramakrishnan CR, Ramakrishnan IV. Subsumption algorithms based on search trees Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1059: 135-148. |
0.662 |
|
| 1995 |
Dawson S, Ramakrishnan CR, Ramakrishnan IV. Design and implementation of jump tables for fast indexing of logic programs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 982: 133-150. DOI: 10.1007/BFb0026818 |
0.734 |
|
| 1995 |
Dawson S, Ramakrishnan CR, Ramakrishnan IV, Sagonas K, Skiena S, Swift T, Warren DS. Unification factoring for efficient execution of logic programs Conference Record of the Annual Acm Symposium On Principles of Programming Languages. 247-258. |
0.696 |
|
| 1993 |
Kaser O, Ramakrishnan CR, Pawagi S. On the conversion of indirect to direct recursion Acm Letters On Programming Languages and Systems. 2: 151-164. DOI: 10.1145/176454.176510 |
0.311 |
|
| 1992 |
Kaser O, Pawagi S, Ramakrishnan CR, Ramakrishnan IV, Sekar RC. Fast parallel implementation of lazy languages - the EQUALS experience . 335-344. |
0.679 |
|
| Show low-probability matches. |
