SMT Solvers Courses and Certifications

Institute for Pure & Applied Mathematics (IPAM)

SMT- Quantifiers, and Future Prospects - IPAM at UCLA

Explore SMT solving, focusing on quantifier reasoning and instantiation techniques. Learn about SMT-LIB input language and future developments in higher-order logic for automated reasoning.

• YouTube
• 53 minutes
• On-Demand
• Free Video

ACM SIGPLAN

Solving Conditional Linear Recurrences for Program Verification: The Periodic Case

Explore a novel approach to solving conditional linear recurrences in program verification, focusing on ultimately periodic index sequences and their closed-form solutions.

• YouTube
• 15 minutes
• On-Demand
• Free Video

ACM SIGPLAN

Implementing Separation Logic Using an SMT-backed Frame Rule

Explore implementing separation logic with SMT-backed Frame Rule for symbolic execution. Learn to simplify verification of programs with pointers using CVC5 solver's decidable fragment support.

• YouTube
• 22 minutes
• On-Demand
• Free Video

ACM SIGPLAN

SMT Theory Arbitrage: Approximating Unbounded Constraints Using Bounded Theories

Explore SMT theory arbitrage for transforming unbounded constraints into bounded ones, improving solver performance and enabling optimization techniques for bounded theories.

• YouTube
• 19 minutes
• On-Demand
• Free Video

ACM SIGPLAN

Towards Trustworthy Automated Program Verifiers: Formally Validating Translations into an Intermediate Verification Language

Explore a novel validation methodology for automated program verifiers, ensuring soundness through formal semantics and proof generation in Isabelle, with focus on Viper and Boogie languages.

• YouTube
• 18 minutes
• On-Demand
• Free Video

ACM SIGPLAN

Ramsey Quantifiers in Linear Arithmetics

Explore Ramsey quantifiers in linear arithmetics, their applications in program termination, and monadic decomposability. Learn about new algorithms for SMT theories and their impact on automated reasoning.

• YouTube
• 19 minutes
• On-Demand
• Free Video

Topos Institute

Proof Certificates in Satisfiability Modulo Theories - SMT Solver Integration and Verification

Delve into automated reasoning with SMT solvers, proof certificates, and their integration with proof assistants for enhanced theorem verification and computational trust.

• YouTube
• 59 minutes
• On-Demand
• Free Video

ACM SIGPLAN

A Real-Blasting Extension of Cvc5 for Reasoning about Floating-Point Arithmetic

Explore a new floating-point arithmetic theory solver in Cvc5 that uses real-blasting instead of bit-blasting, demonstrating improved performance through lazy axiom instantiation and real-integer arithmetic reasoning.

• YouTube
• 29 minutes
• On-Demand
• Free Video

ACM SIGPLAN

FO-Complete Program Verification for Heap Logics

Discover FO-complete program verification techniques for heap logics using frame logic and separation logic to verify data structure manipulation with theoretical completeness guarantees.

• YouTube
• 12 minutes
• On-Demand
• Free Video

ACM SIGPLAN

Validating SMT Rewriters via Rewrite Space Exploration Supported by Generative Equality Saturation

Discover Aries, a novel technique for validating SMT solver rewrite systems through mimetic mutation and deductive rewriting using generative equality saturation to detect bugs.

• YouTube
• 15 minutes
• On-Demand
• Free Video

ACM SIGPLAN

Formalization of a Proof Calculus for Incremental Linearization for Satisfiability Modulo Nonlinear Arithmetic and Transcendental Functions

Explore formal verification of SMT solving techniques for nonlinear arithmetic using Lean proof assistant and incremental linearization methods.

• YouTube
• 22 minutes
• On-Demand
• Free Video

Cooper

SMT Solvers in IT Security - Deobfuscating Binary Code with Logic

Explore SMT solvers for deobfuscating binary code in IT security. Learn practical applications, theoretical limitations, and solutions for enhancing malware analysis and vulnerability identification.

• YouTube
• 27 minutes
• On-Demand
• Free Video

PapersWeLove

Liquid Type Systems - Understanding Type Theory and SMT Solvers

Explore the innovative Liquid Types system, combining traditional type theory with SMT solvers to enhance type system expressivity while maintaining practical usability in programming languages.

• YouTube
• 1 hour 9 minutes
• On-Demand
• Free Video

This class is designed to be hands-on, and we will be using several Python frameworks against CTF challenges: a binary analysis framework called angr and a SMT solver called z3.

• Independent
• On-Demand
• Free Online Course

OpenSecurityTraining2

Reverse Engineering 3201 - Symbolic Analysis

Master symbolic analysis techniques using SAT solvers, SMT theory, z3Py, and angr for advanced reverse engineering challenges and binary bomb defusing.

• YouTube
• 3 hours 11 minutes
• On-Demand
• Free Video