A Better Approximation for Interleaved Dyck Reachability
Offered By: ACM SIGPLAN via YouTube
Course Description
Overview
Explore a 17-minute video presentation from the SOAP 2024 conference that introduces a more precise approximation for interleaved Dyck reachability. Delve into the challenges of context- and field-sensitive static analysis, and discover how the presenters extend the mutual-refinement algorithm to achieve higher precision. Learn about the development of refined CFLs for expressing each type of sensitivity and the application of on-demand analysis to mask out irrelevant graph parts. Examine the experimental results showing significant improvements over existing approaches, with a focus on a challenging benchmark where the new method achieves 51% reduction in reachable pairs compared to recent alternatives.
Syllabus
[SOAP24] A Better Approximation for Interleaved Dyck Reachability
Taught by
ACM SIGPLAN
Related Courses
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer