Name
Affiliation
Papers
RANJIT JHALA
Univ Calif Berkeley, Dept EECS, Berkeley, CA 94720 USA
84
Collaborators
Citations 
PageRank 
153
2183
111.68
Referers 
Referees 
References 
3590
1519
1282
Search Limit
1001000
Title
Citations
PageRank
Year
Isolation without Taxation Near-Zero-Cost Transitions for WebAssembly and SFI00.342022
Solver-Aided Constant-Time Hardware Verification00.342021
Automatically eliminating speculative leaks from cryptographic code with blade30.372021
RAPID: checking API usage for the cloud in the cloud00.342021
Refinements of Futures Past - Higher-Order Specification with Implicit Refinement Types.00.342021
Refinement Types: A Tutorial00.342021
STORM - Refinement Types for Secure Web Applications.00.342021
PABLO - Helping Novices Debug Python Code Through Data-Driven Fault Localization.00.342020
Type error feedback via analytic program repair10.352020
Digging for fold: synthesis-aided API discovery for Haskell00.342020
Block public access: trust safety verification of access control policies00.342020
Program synthesis by type-guided abstraction refinement10.402020
InFix - Automatically Repairing Novice Program Inputs.20.362019
Iodine: Verifying Constant-Time Execution Of Hardware00.342019
FaCT: a DSL for timing-sensitive computation20.352019
Pretend synchrony: synchronous verification of asynchronous distributed programs.00.342019
Lazy counterfactual symbolic execution00.342019
Refinement reflection: complete verification with SMT60.572018
Towards Verified, Constant-time Floating Point Operations.30.372018
Dynamic witnesses for static type errors (or, ill-typed programs usually go wrong).00.342018
Finding and Preventing Bugs in JavaScript Bindings40.422017
Local refinement typing00.342017
Learning to blame: localizing novice type errors with data-driven diagnosis20.352017
Verifying distributed programs via canonical sequentialization20.372017
Deriving Law-Abiding Instances.00.342017
FaCT: A Flexible, Constant-Time Programming Language40.392017
Refinement Types for TypeScript.80.482016
Printing floating-point numbers: a faster, always correct method.10.392016
Dynamic Witnesses for Static Type Errors.30.402016
Language Based Verification Tools for Functional Programs (Dagstuhl Seminar 16131).00.342016
Refinement Reflection (or, how to turn your favorite language into a proof assistant using SMT).10.392016
Nsf Expedition On Variability-Aware Software: Recent Results And Contributions30.372015
Trust, but Verify: Two-Phase Typing for Dynamic Languages.20.362015
On Subnormal Floating Point and Abnormal Timing350.982015
Bounded refinement types80.452015
LiquidHaskell: experience with refinement types in the real world190.772014
Refinement types for Haskell140.562014
From Safety To Termination And Back: SMT-Based Verification For Lazy Languages.00.342014
Abstractions from proofs21710.722014
Type Targeted Testing60.452014
Scripting Languages and Frameworks: Analysis and Verification (Dagstuhl Seminar 14271).00.342014
Refinement types for Haskell100.522014
Abstract refinement types220.722013
Dependent types for JavaScript240.892012
Deterministic parallelism via liquid effects70.522012
Nested refinements: a logic for duck typing230.822012
CSolve: verifying c with liquid types50.402012
Verifying GPU kernels by test amplification270.942012
Towards verifying android apps for the absence of no-sleep energy bugs190.912012
System D: Dependent Dynamic Dictionaries00.342011
  • 1
  • 2