Verification of a Subgraph Construction Algorithm for Geometric Graphs - VMCAI 2024
Offered By: ACM SIGPLAN via YouTube
Course Description
Overview
Explore an 18-minute conference talk from ACM SIGPLAN's VMCAI'24 that delves into the automatic verification of a subgraph construction algorithm. Learn how researchers Lucas Böltz, Viorica Sofronie-Stokkermans, and Hannes Frey tackle the challenge of verifying crucial steps in the original proof of correctness for an algorithm that systematically removes edges from geometric graphs to produce connected, non-intersecting graphs. Discover the innovative approaches used to model and reason about both geometric properties of graphs in the Euclidean plane and graph connectivity. Gain insights into the use of plane geometry axiomatization, additional predicates for graph structure representation, and linked lists for modeling specific path classes in geometric graphs.
Syllabus
[VMCAI'24] On the Verification of a Subgraph Construction Algorithm
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