Screencast version of my PLDI 2013 talk "Thresher: Precise Refutations for Heap Reachability"
A demonstration of the abstract domains for sets of integers constructed using QUIC graphs from abstract domains for integers. The artifact submission web page is cs.colorado.edu/~coxaj/quicgraphs/index.html.
Programming Languages and Verification at the University of Colorado Boulder
More stuff from “CU Programming Languages and Verification”
Heads up: the shoutbox will be retiring soon. It’s tired of working, and can’t wait to relax. You can still send a message to the channel owner, though!
Channels are a simple, beautiful way to showcase and watch videos. Browse more Channels.