Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a 13-minute conference presentation from OOPSLA 2025 that introduces an extension to δ-decision procedures for handling integrals of user-specified real functions in verification and synthesis problems. Learn how researchers from the University of Illinois at Urbana-Champaign, University of Missouri, and University of Illinois at Chicago developed ∫dReal, a tool built on top of dReal that can determine the truth of formulas over real numbers containing integral constraints. Discover the practical applications of this approach through evaluation on problems involving algorithm fairness verification, privacy mechanism analysis, and parameter synthesis for desired utility in privacy mechanisms. Examine the theoretical foundations of δ-satisfiability in the theory of reals and understand how this framework addresses many synthesis and verification challenges that can be reduced to determining formula truth over real numbers. Access the accompanying research article, supplementary materials, and artifacts that have been evaluated as available, reusable, and with reproduced results, providing comprehensive resources for further exploration of this verification methodology.
