Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Watch a 25-minute conference presentation from POPL 2018 introducing Refinement Reflection, a groundbreaking framework for constructing SMT-based deductive verifiers. Learn how reflecting code into refinement types enables precise, decidable verification through the SMT logic. Discover how equational proofs can be written using pattern-matching and recursion for case-splitting and induction, allowing specification of functional correctness properties through propositions-as-types. Explore the Proof by Logical Evaluation algorithm that automates equational reasoning using model checking and abstract interpretation techniques. See how this framework was implemented in Liquid Haskell to verify algebraic laws for Monoid, Applicative, Functor and Monad typeclasses, as well as create the first library verifying crucial assumptions for safe deterministic parallelism.
