1 citations · 1 across the 6 of their papers we have counts for
8 papers
Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary
Hanxi Chen, Noam Zilberstein, Andrew C. Myers +1
In the context of probabilistic programs, an oblivious adversary resolves nondeterminism without seeing the outcomes of random draws. Obliviousness is a common assumption in online…
A Calculus for Flow-Limited Authorization
Owen Arden, Anitha Gollamudi, Ethan Cecchetti +2
Real-world applications routinely make authorization decisions based on dynamic computation. Reasoning about dynamically computed authority is challenging. Integrity of the system…
Heterogeneous Paxos: Technical Report
Isaac Sheff, Xinwen Wang, Robbert van Renesse +1
In distributed systems, a group of achieve when, by observing the output of some , they all arrive at the same value. C…
Handling Bidirectional Control Flow: Technical Report
Yizhou Zhang, Guido Salvaneschi, Andrew C. Myers
Pressed by the difficulty of writing asynchronous, event-driven code, mainstream languages have recently been building in support for a variety of advanced control-flow features. M…
The Cost of Software-Based Memory Management Without Virtual Memory
Drew Zagieboylo, G. Edward Suh, Andrew C. Myers
Virtual memory has been a standard hardware feature for more than three decades. At the price of increased hardware complexity, it has simplified software and promised strong isola…
Charlotte: Composable Authenticated Distributed Data Structures, Technical Report
Isaac Sheff, Xinwen Wang, Haobin Ni +2
We present Charlotte, a framework for composable, authenticated distributed data structures. Charlotte data is stored in blocks that reference each other by hash. Together, all Cha…