Verified Functional Programming of an Abstract Interpreter
summary
Claims a fully implemented abstract interpreter in the F verified programming environment that proves soundness while keeping proofs tiny: about 40 lines of proofs (roughly 10× fewer than comparable Coq projects). Implementation uses refinement types and SMT automation, encodes an interval domain with widening* plus backward expression analysis, finds a machine-integer overflow case the typechecker rejects, and compiles to OCaml/JavaScript so the analyzer runs and is extractable to production.
AI-written summary · about