Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Hance, Travis"'
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., forever). However, the situation is more complicated for temporarily shared
Externí odkaz:
http://arxiv.org/abs/2309.04851
Autor:
Lattuada, Andrea, Hance, Travis, Cho, Chanhee, Brun, Matthias, Subasinghe, Isitha, Zhou, Yi, Howell, Jon, Parno, Bryan, Hawblitzel, Chris
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 Rust ideal for developing low-level, high-assurance systems. For such s
Externí odkaz:
http://arxiv.org/abs/2303.05491
Autor:
Polikarpova, Nadia, Stefan, Deian, Yang, Jean, Itzhaky, Shachar, Hance, Travis, Solar-Lezama, Armando
We present Lifty, a domain-specific language for data-centric applications that manipulate sensitive data. A Lifty programmer annotates the sources of sensitive data with declarative security policies, and the language statically and automatically ve
Externí odkaz:
http://arxiv.org/abs/1607.03445
Autor:
Yang, Jean, Hance, Travis, Austin, Thomas H., Solar-Lezama, Armando, Flanagan, Cormac, Chong, Stephen
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 across the application and database, works with existing relational dat
Externí odkaz:
http://arxiv.org/abs/1507.03513
Autor:
Aaronson, Scott, Hance, Travis
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) to within eps*||A||^n additive error. A major advantage of Gurvits's al
Externí odkaz:
http://arxiv.org/abs/1212.0025
Autor:
Hance, Travis, Li, Nan
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). In this paper, we present several direct bijective proofs that cover is
Externí odkaz:
http://arxiv.org/abs/1208.3063
Autor:
Hance, Travis J
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
Thesis: S.B., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
C
Thesis: S.B., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
C
Externí odkaz:
http://hdl.handle.net/1721.1/91824
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.