Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a formal verification approach to identifying atom exhaustion vulnerabilities in Erlang programs through this 41-minute conference presentation from Erlang 2025. Learn how researchers from Eötvös Loránd University have developed a mechanised proof system using the Coq proof assistant to formally verify the presence of atom exhaustion vulnerabilities in sequential Core Erlang programs. Discover the formalization of atom exhaustion within existing Core Erlang formal semantics and examine a sound and complete calculus designed for structured reasoning about this specific vulnerability. Understand how formal methods can validate static analysis findings and reduce false positives that often undermine developer confidence in security tools. Gain insights into the intersection of formal verification, software security, and functional programming languages, with particular focus on how mathematical proofs can enhance the reliability of vulnerability detection in Erlang codebases.
