32 citations · 37 across the 5 of their papers we have counts for
5 papers
Leaf: Modularity for Temporary Sharing in Separation Logic (Extended Version)
Travis Hance, Jon Howell, Oded Padon +1
In concurrent verification, separation logic provides a strong story for handling both resources that are owned exclusively and resources that are shared persistently (i.e., foreve…
Verus: Verifying Rust Programs using Linear Ghost Types (extended version)
Andrea Lattuada, Travis Hance, Chanhee Cho +6
The Rust programming language provides a powerful type system that checks linearity and borrowing, allowing code to safely manipulate memory without garbage collection and making R…
Precise, Dynamic Information Flow for Database-Backed Applications
Jean Yang, Travis Hance, Thomas H. Austin +3
We present an approach for dynamic information flow control across the application and database. Our approach reduces the amount of policy code required, yields formal guarantees a…
Generalizing and Derandomizing Gurvits's Approximation Algorithm for the Permanent
Scott Aaronson, Travis Hance
Around 2002, Leonid Gurvits gave a striking randomized algorithm to approximate the permanent of an n*n matrix A. The algorithm runs in O(n^2/eps^2) time, and approximates Per(A) t…
An Eulerian permutation statistic and generalizations
Travis Hance, Nan Li
Recently, the second author studied an Eulerian statistic (called cover) in the context of convex polytopes, and proved an equal joint distribution of (cover,des) with (des,exc). I…