Author

Kavita Ravi

Observed name: K. Ravi

Observed institutions: University of Colorado Boulder, University of Colorado System, Cadence Design Systems (United States)

OpenAlex ID: A5112243571

High-density reachability analysis

1995 · Kavita Ravi, Fabio Somenzi · 137

Minimal Assignments for Bounded Model Checking

2004 · Kavita Ravi, Fabio Somenzi · Lecture notes in computer science · 111

High-density reachability analysis

2002 · K. Ravi, F. Somenzi · International Conference on Computer Aided Design · 95

Efficient Decision Procedures for Model Checking of Linear Time Logic Properties

1999 · Roderick Bloem, Kavita Ravi, et al. · Lecture notes in computer science · 80

A Comparative Study of Symbolic Algorithms for the Computation of Fair Cycles

2000 · Kavita Ravi, Roderick Bloem, et al. · Lecture notes in computer science · 78

To split or to conjoin

2000 · In-Ho Moon, James H. Kukula, et al. · ACM/IEEE Design Automation Conference (DAC) · 78

PDF

Fate and free will in error traces

2004 · HoonSang Jin, Kavita Ravi, et al. · International Journal on Software Tools for Technology Transfer · 77

Approximation and decomposition of binary decision diagrams

1998 · K. Ravi, K.L. McMillan, et al. · ACM/IEEE Design Automation Conference (DAC) · 69

PDF

Symbolic guided search for CTL model checking

2000 · Roderick Bloem, Kavita Ravi, et al. · ACM/IEEE Design Automation Conference (DAC) · 59

PDF

Hints to Accelerate Symbolic Traversal

1999 · Kavita Ravi, Fabio Somenzi · Lecture notes in computer science · 46

Fate and FreeWill in Error Traces

2002 · HoonSang Jin, Kavita Ravi, et al. · Lecture notes in computer science · 32

Analysis of Symbolic SCC Hull Algorithms

2002 · Fabio Somenzi, Kavita Ravi, et al. · Lecture notes in computer science · 24

A Hybrid Algorithm for LTL Games

2008 · Saqib Sohail, Fabio Somenzi, et al. · Springer eBooks · 23

Approximate Finite State Machine Traversal: Extensions and New Results

1995 · Hyeonglae Cho, Gary D. Hachtel, et al. · PORTO Publications Open Repository TOrino (Politecnico di Torino) · 19

Divide and Compose: SCC Refinement for Language Emptiness

2001 · Chao Wang, Roderick Bloem, et al. · Lecture notes in computer science · 15

Application of Formal Word-Level Analysis to Constrained Random Simulation

2008 · Hyondeuk Kim, Hoonsang Jin, et al. · Lecture notes in computer science · 12

PDF

Efficient fixpoint computation for invariant checking

2003 · K. Ravi, F. Somenzi · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · 12

Modular verification of multipliers

1996 · Kavita Ravi, Abelardo Pardo, et al. · Lecture notes in computer science · 9

Compositional SCC Analysis for Language Emptiness

2006 · Chao Wang, Roderick Bloem, et al. · Formal Methods in System Design · 7

Approximations for fixpoint computations in symbolic model chec king

2000 · Roderick Bloem, In-Ho Moon, et al. · 3

Application of Formal Word-Level Analysis to Constrained Random Simulation Tool Paper

2008 · Hyondeuk Kim, HoonSang Jin, et al.

Analysi so fSymboli cSC CHul lAlgorithms

2002 · Fabio Somenzi, Kavita Ravi, et al.

Works count: 26

Citation count: 986

H-index: 15

I10-index: 17