3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.PL2026
Foundational Constraint Solving for Expressive Refinement Typing
Jam Kabeer Ali Khan, Petros Markopoulos, Nico Lehmann +1
SMT-based program verifiers are hamstrung by two problems: expressiveness, because predictable verification restricts to the boundaries of SMT decidability, and trust, because the…
cs.PL2022★ 3 cited
Flux: Liquid Types for Rust
Nico Lehmann, Adam Geller, Niki Vazou +1
We introduce Flux, which shows how logical refinements can work hand in glove with Rust's ownership mechanisms to yield ergonomic type-based verification of low-level pointer manip…