32 citations · 50 across the 8 of their papers we have counts for
8 papers
How We Built Cedar: A Verification-Guided Approach
Craig Disselkoen, Aaron Eline, Shaobo He +10
This paper presents verification-guided development (VGD), a software engineering process we used to build Cedar, a new policy language for expressive, fast, safe, and analyzable a…
Cedar: A New Language for Expressive, Fast, Safe, and Analyzable Authorization (Extended Version)
Joseph W. Cutler, Craig Disselkoen, Aaron Eline +12
Cedar is a new authorization policy language designed to be ergonomic, fast, safe, and analyzable. Rather than embed authorization logic in an application's code, developers can wr…
A Pretty Expressive Printer (with Appendices)
Sorawee Porncharoenwase, Justin Pombrio, Emina Torlak
Pretty printers make trade-offs between the expressiveness of their pretty printing language, the optimality objective that they minimize when choosing between different ways to la…
Precise Attack Synthesis for Smart Contracts
Yu Feng, Emina Torlak, Rastislav Bodik
Smart contracts are programs running on top of blockchain platforms. They interact with each other through well-defined interfaces to perform financial transactions in a distribute…
Refinement Types for Ruby
Milod Kazerounian, Niki Vazou, Austin Bourgerie +2
Refinement types are a popular way to specify and reason about key program properties. In this paper, we introduce RTR, a new system that adds refinement types to Ruby. RTR is buil…
SIMPL: A DSL for Automatic Specialization of Inference Algorithms
Rohin Shah, Emina Torlak, Rastislav Bodik
Inference algorithms in probabilistic programming languages (PPLs) can be thought of as interpreters, since an inference algorithm traverses a model given evidence to answer a quer…