YoVDO

Historia: Refuting Callback Reachability with Message-History Logics

Offered By: ACM SIGPLAN via YouTube

Tags

Static Analysis Courses Event-Driven Programming Courses Temporal Logic Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking approach to addressing the callback reachability problem in event-driven programming frameworks through this 18-minute conference talk from OOPSLA2 2023. Delve into the innovative use of message-history logics to decouple the specification of callback control flow from app code analysis. Learn how the Historia verifier employs a targeted specification approach to prove the absence of multi-callback bug patterns in real-world Android apps. Discover the potential of this middle-ground solution that allows for gradual refinement of callback control flow to prove assertions of interest, offering a unique capability to distinguish between buggy and fixed versions in challenging real-world scenarios.

Syllabus

[OOPSLA23] Historia: Refuting Callback Reachability with Message-History Logics


Taught by

ACM SIGPLAN

Related Courses

Razonamiento artificial
Universidad Nacional Autónoma de México via Coursera
Embedded Systems - Design Verification and Test
NPTEL via YouTube
Feedback Control Theory - Architectures and Tools for Real-Time Decision Making II
Simons Institute via YouTube
Model Checking and Temporal Logic - E. Allen Emerson's Turing Award Lecture
Association for Computing Machinery (ACM) via YouTube
Weeks of Debugging Can Save You Hours of TLA+
USENIX via YouTube