Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Travis Hance"'
Autor:
Andrea Lattuada, Travis Hance, Chanhee Cho, Matthias Brun, Isitha Subasinghe, Yi Zhou, Jon Howell, Bryan Parno, Chris Hawblitzel
Publikováno v:
Proceedings of the ACM on Programming Languages, 7 (OOPSLA1)
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
Autor:
Travis Hance, Nadia Polikarpova, Deian Stefan, Shachar Itzhaky, Armando Solar-Lezama, Jean Yang
Publikováno v:
Proceedings of the ACM on Programming Languages, vol 4, iss ICFP
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::677310ee035e01fa2c501601303f16f6
http://arxiv.org/abs/1607.03445
http://arxiv.org/abs/1607.03445
Autor:
Travis Hance, Thomas H. Austin, Armando Solar-Lezama, Jean Yang, Cormac Flanagan, Stephen Chong
Publikováno v:
arXiv
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
Autor:
Travis Hance, Scott Aaronson
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07151a8b34bd27bd612430536d016b77
http://arxiv.org/abs/1212.0025
http://arxiv.org/abs/1212.0025