Type-Based Incorrectness Reasoning - Integrating Underapproximate Analysis in Refinement Types
ACM SIGPLAN via YouTube
Free courses from frontend to fullstack and AI
Google AI Professional Certificate - Learn AI Skills That Get You Hired
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore the connection between coverage types and incorrectness logic in this 18-minute conference talk presented at ACM SIGPLAN's Incorrectness'24. Delve into the proposal by Zhe Zhou, Benjamin Delaware, and Suresh Jagannathan to integrate incorrectness reasoning within an expressive refinement type system. Discover how coverage types generalize refinement types in functional languages, supporting must-style underapproximate reasoning, particularly useful in property-based testing frameworks for verifying both completeness and safety of test generators. Examine the potential benefits this integration offers to functional programmers, program verifiers, and program analysis tools.
Syllabus
[Incorrectness'24] Type-Based Incorrectness Reasoning
Taught by
ACM SIGPLAN