63 citations · 85 across the 5 of their papers we have counts for
6 papers
The Case for Anticipating Undesirable Consequences of Computing Innovations Early, Often, and Across Computer Science
Rock Yuren Pang, Dan Grossman, Tadayoshi Kohno +1
From smart sensors that infringe on our privacy to neural nets that portray realistic imposter deepfakes, our society increasingly bears the burden of negative, if unintended, cons…
Rewrite Rule Inference Using Equality Saturation
Chandrakana Nandi, Max Willsey, Amy Zhu +6
Many compilers, synthesizers, and theorem provers rely on rewrite rules to simplify expressions or prove equivalences. Developing rewrite rules can be difficult: rules may be subtl…
Proof Repair across Type Equivalences
Talia Ringer, RanDair Porter, Nathaniel Yazdani +2
We describe a new approach to automatically repairing broken proofs in the Coq proof assistant in response to changes in types. Our approach combines a configurable proof term tran…
Synthesizing Structured CAD Models with Equality Saturation and Inverse Transformations
Chandrakana Nandi, Max Willsey, Adam Anderson +4
Recent program synthesis techniques help users customize CAD models(e.g., for 3D printing) by decompiling low-level triangle meshes to Constructive Solid Geometry (CSG) expressions…
View-Driven Deduplication with Active Learning
Kristi Morton, Hannaneh Hajishirzi, Magdalena Balazinska +1
Visual analytics systems such as Tableau are increasingly popular for interactive data exploration. These tools, however, do not currently assist users with detecting or resolving…
Programming Idioms for Transactional Events
Matthew Kehrt, Laura Effinger-Dean, Michael Schmitz +1
Transactional events (TE) are an extension of Concurrent ML (CML), a programming model for synchronous message-passing. Prior work has focused on TE's formal semantics and its impl…