First-Order Theories: The Foundation of Automated Reasoning and Verification
Explore first-order theories, their role in decision procedures, and applications in formal verification of software and hardware systems.
Formal Verification
The Boolean Satisfiability Problem: From Theory to Real-World Applications
Explore how SAT, the first proven NP-complete problem, powers modern technology from hardware verification to AI planning, and why it matters for developers, engineers, and computer scientists.
Modern SAT Solvers: From Theory to Practice
Explore how modern SAT solvers evolved from theoretical algorithms to practical tools solving millions-variable problems. Learn CDCL, watched literals, and real-world applications.
Automated Theorem Proving: Overview and Foundations
Comprehensive introduction to automated theorem proving, exploring how to automatically discover and verify mathematical proofs using computational methods.
Formal Verification Overview: Ensuring System Correctness
Comprehensive overview of formal verification, exploring techniques for proving that systems satisfy their specifications.
Interactive Theorem Provers: Coq, Isabelle, and Beyond
Comprehensive guide to interactive theorem provers, exploring how to use tools like Coq and Isabelle for formal verification and mathematical proof.
Proof Assistants and Formal Verification: Ensuring Correctness
Comprehensive guide to proof assistants and formal verification, exploring how to ensure correctness of software and hardware systems.
Satisfiability Modulo Theories (SMT): Beyond Boolean Logic
Comprehensive guide to satisfiability modulo theories, exploring how to solve problems in theories like arithmetic, arrays, and uninterpreted functions.