1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.CR2019★ 1 cited
Weird Machines as Insecure Compilation
Jennifer Paykin, Eric Mertens, Mark Tullsen +4
Weird machines---the computational models accessible by exploiting security vulnerabilities---arise from the difference between the model a programmer has in her head of how her pr…
cs.PL2015★ 1 cited
Bounded Refinement Types
Niki Vazou, Alexander Bakst, Ranjit Jhala
We present a notion of bounded quantification for refinement types and show how it expands the expressiveness of refinement typing by using it to develop typed combinators for: (1)…