16 citations · 18 across the 3 of their papers we have counts for
3 papers
cs.CR2021
Solver-Aided Constant-Time Circuit Verification
Rami Gokhan Kici, Klaus v. Gleissenthall, Deian Stefan +1
We present Xenon, a solver-aided method for formally verifying that Verilog hardware executes in constant-time. Xenon scales to realistic hardware designs by drastically reducing t…
cs.PL2016★ 2 cited
Refinement Reflection (or, how to turn your favorite language into a proof assistant using SMT)
Niki Vazou, Ranjit Jhala
Refinement Reflection turns your favorite programming language into a proof assistant by reflecting the code implementing a user-defined function into the function's (output) refin…
cs.PL2010
HMC: Verifying Functional Programs Using Abstract Interpreters
Ranjit Jhala, Rupak Majumdar, Andrey Rybalchenko
We present Hindley-Milner-Cousots (HMC), an algorithm that allows any interprocedural analysis for first-order imperative programs to be used to verify safety properties of typed h…