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