Person: C. R. Ramakrishnan

DBLP: Ramakrishnan:C=_R=

Facilitated 2 volumes:

Ed

Ed

Contributed to:

2012

2011

2007

2006

2006

2006

2005

2005

2005

2004

2004

2003

2003

2003

2003

2002

2002

2002

2001

2001

2000

2000

2000

1999

1999

1999

1999

1998

1998

1998

1998

1997

1996

1996

1995

1995

1995

1995

1993

1992

Wrote 45 papers:

ICLP-J-2012-GorlinRS #logic programming #model checking #probability

Model checking with probabilistic tabled logic programming (AG, CRR, SAS), pp. 681–700.

ICLP-J-2012-IslamRR #logic programming #probability #random #source code

Inference in probabilistic logic programs with continuous random variables (MAI, CRR, IVR), pp. 505–523.

TACAS-2011-BartocciGKRS #probability

Model Repair for Probabilistic Systems (EB, RG, PK, CRR, SAS), pp. 326–340.

PADL-2007-Sarna-StarostaR #compilation #constraints #evaluation #performance

Compiling Constraint Handling Rules for Efficient Tabled Evaluation (BSS, CRR), pp. 170–184.

ICLP-2006-RamakrishnanRW #deduction #logic programming #spreadsheet #using

Deductive Spreadsheets Using Tabled Logic Programming (CRR, IVR, DSW), pp. 391–405.

ICLP-2006-SahaR #algorithm #evaluation #incremental #logic programming #source code

A Local Algorithm for Incremental Evaluation of Tabled Logic Programs (DS, CRR), pp. 56–71.

PADL-2006-SahaR #evaluation #incremental #logic programming #prolog #source code

Incremental Evaluation of Tabled Prolog: Beyond Pure Logic Programs (DS, CRR), pp. 215–229.

TACAS-2006-YangBR #verification #π-calculus

Parameterized Verification of π-Calculus Systems (PY, SB, CRR), pp. 42–57.

ICLP-2005-SahaR #data type #evaluation #graph #incremental #performance

Symbolic Support Graph: A Space Efficient Data Structure for Incremental Tabled Evaluation (DS, CRR), pp. 235–249.

PADL-2005-YangDRS #compilation #mobile #model checking #performance #process

A Provably Correct Compiler for Efficient Model Checking of Mobile Processes (PY, YD, CRR, SAS), pp. 113–127.

PPDP-2005-SahaR #analysis #incremental #logic programming #points-to #using

Incremental and demand-driven points-to analysis using logic programming (DS, CRR), pp. 117–128.

FLOPS-2004-PemmasaniGDRR #logic programming #online #source code

Online Justification for Tabled Logic Programs (GP, HFG, YD, CRR, IVR), pp. 24–38.

PDCL-2004-RoychoudhuryR #automation #concurrent #verification

Unfold/Fold Transformations for Automated Verification of Parameterized Concurrent Systems (AR, CRR), pp. 261–290.

CAV-2003-DongRS #model checking #proving

Evidence Explorer: A Tool for Exploring Model-Checking Proofs (YD, CRR, SAS), pp. 215–218.

ICLP-2003-PemmasaniGDRR #logic programming #online #source code

Online Justification for Tabled Logic Programs (GP, HFG, YD, CRR, IVR), pp. 500–501.

ICLP-2003-SahaR #evaluation #incremental #logic programming #source code

Incremental Evaluation of Tabled Logic Programs (DS, CRR), pp. 392–406.

TACAS-2003-BasuR #analysis #composition #verification

Compositional Analysis for Verification of Parameterized Systems (SB, CRR), pp. 315–330.

VMCAI-2003-YangRS #encoding #logic #mobile #model checking #process #using #π-calculus

A Logical Encoding of the pi-Calculus: Model Checking Mobile Processes Using Tabled Resolution (PY, CRR, SAS), pp. 116–131.

ICLP-2002-PemmasaniRR #constraints #logic programming #model checking #performance #realtime #using

Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints (GP, CRR, IVR), pp. 100–114.

LOPSTR-2002-GuoRR #program transformation

Justification Based on Program Transformation (HFG, CRR, IVR), pp. 158–159.

TACAS-2002-BasuKPR #model checking #recursion #source code

Resource-Constrained Model Checking of Recursive Programs (SB, KNK, LRP, CRR), pp. 236–250.

ICLP-2001-BasuMRRV #bisimulation #constraints #logic programming #using

Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming (SB, MM, CRR, IVR, RMV), pp. 166–180.

ICLP-2001-GuoRR

Speculative Beats Conservative Justification (HFG, CRR, IVR), pp. 150–165.

ICLP-2001-KumarRS #equation #fixpoint #modelling

Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models (KNK, CRR, SAS), pp. 227–241.

PADL-2001-Ramakrishnan #calculus #logic programming #model checking #using #μ-calculus

A Model Checker for Value-Passing μ-Calculus Using Logic Programming (CRR), pp. 1–13.

CAV-2000-RamakrishnanRSDDRV #named #tool support #verification

XMC: A Logic-Programming-Based Verification Toolset (CRR, IVR, SAS, YD, XD, AR, VNV), pp. 576–580.

PPDP-2000-RoychoudhuryRR #proving #using

Justifying proofs using memo tables (AR, CRR, IVR), pp. 178–189.

TACAS-2000-RoychoudhuryKRRS #logic programming #program transformation #using #verification

Verification of Parameterized Systems Using Logic Program Transformations (AR, KNK, CRR, IVR, SAS), pp. 172–187.

FLOPS-1999-JohnsonRRR #evaluation #logic programming #performance #source code

A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs (EJ, CRR, IVR, PR), pp. 284–300.

PPDP-1999-RoychoudhuryKRR #framework #logic programming #source code

A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs (AR, KNK, CRR, IVR), pp. 396–413.

RTA-1999-BachmairRRT #normalisation #term rewriting

Normalization via Rewrite Closures (LB, CRR, IVR, AT), pp. 190–204.

TACAS-1999-DongDRRRSSSW #case study #comparative #concurrent #tool support #verification

Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools (YD, XD, YSR, CRR, IVR, SAS, OS, EWS, DSW), pp. 74–88.

ALP-PLILP-1998-CuiDDKRRRSW #logic programming #model checking

Logic Programming and Model Checking (BC, YD, XD, KNK, CRR, IVR, AR, SAS, DSW), pp. 1–20.

JICSLP-1998-RaoRR #on the #scheduling

On the Optimality of Scheduling Strategies in Subsumption-based Tabled Resolution (PR, CRR, IVR), pp. 310–324.

PODS-1998-DavulcuKRR #analysis #logic #modelling #workflow

Logic Based Modeling and Analysis of Workflows (HD, MK, CRR, IVR), pp. 25–33.

TACAS-1998-LiuRS #evaluation #fixpoint #performance

Fully Local and Efficient Evaluation of Alternating Fixed Points (XL, CRR, SAS), pp. 5–19.

CAV-1997-RamakrishnanRRSSW #model checking #performance #using

Efficient Model Checking Using Tabled Resolution (YSR, CRR, IVR, SAS, TS, DSW), pp. 143–154.

JICSLP-1996-RaoRR #concurrent #thread

A Thread in Time Saves Tabling Time (PR, CRR, IVR), pp. 112–126.

PLDI-1996-DawsonRW #case study #logic programming #program analysis #using

Practical Program Analysis Using General Purpose Logic Programming Systems — A Case Study (SD, CRR, DSW), pp. 117–126.

ILPS-1995-DawsonRRS #optimisation #unification

Optimizing Clause Resolution: Beyond Unification Factoring (SD, CRR, IVR, TS), pp. 194–208.

PEPM-1995-RamakrishnanRS #analysis #constraints #framework #logic programming #source code #theorem proving

A Symbolic Constraint Solving Framework for Analysis of Logic Programs (CRR, IVR, RCS), pp. 12–23.

PLILP-1995-DawsonRR #design #implementation #logic programming #performance #source code

Design and Implementation of Jump Tables for Fast Indexing of Logic Programs (SD, CRR, IVR), pp. 133–150.

POPL-1995-DawsonRRSSSW #execution #logic programming #performance #source code #unification

Unification Factoring for Efficient Execution of Logic Programs (SD, CRR, IVR, KFS, SS, TS, DSW), pp. 247–258.

ICLP-1993-DawsonRRS #logic programming #source code

Extracting Determinacy in Logic Programs (SD, CRR, IVR, RCS), pp. 424–438.

LFP-1992-KaserPRRS #experience #implementation #lazy evaluation #parallel #performance

Fast Parallel Implementation of Lazy Languages — The EQUALS Experience (OK, SP, CRR, IVR, RCS), pp. 335–344.