ProVerif with Lemmas, Induction, Fast Subsumption, and Much More
Offered By: IEEE via YouTube
Course Description
Overview
Explore the latest advancements in ProVerif, a powerful tool for automated security protocol analysis, in this 17-minute IEEE conference talk. Delve into the enhanced features including lemmas, induction, and fast subsumption techniques. Learn how these improvements contribute to more efficient and comprehensive security protocol verification. Gain insights from experts Bruno Blanchet, Vincent Cheval, and Véronique Cortier as they discuss the expanded capabilities and potential applications of ProVerif in modern cryptographic protocol analysis.
Syllabus
ProVerif with Lemmas, Induction, Fast Subsumption, and Much More
Taught by
IEEE Symposium on Security and Privacy
Tags
Related Courses
SPARK 2014AdaCore via Independent Automated Reasoning: Symbolic Model Checking
EIT Digital via Coursera Software Testing and Verification
University System of Maryland via edX Haskell for Imperative Programmers
YouTube Model Checking and Temporal Logic - E. Allen Emerson's Turing Award Lecture
Association for Computing Machinery (ACM) via YouTube