• Publications
  • Influence
Combinatorial sketching for finite programs
TLDR
We develop SKETCH, a language for finite programs with linguistic support for sketching. Expand
  • 625
  • 71
  • PDF
Sketching stencils
TLDR
We develop a sketching synthesizer that works for stencil computations, a large class of programs that have unbounded inputs and outputs, as well as unbounded number of computations. Expand
  • 146
  • 8
  • PDF
Using deformations for browsing volumetric data
TLDR
We explore an alternate strategy for browsing that uses deformations, where the user can cut into and open up, spread apart, or peel away parts of the volume in real time, making the interior visible while still retaining surrounding context. Expand
  • 215
  • 3
  • PDF
Probabilistic Data Management for Pervasive Computing: The Data Furnace Project
TLDR
The wide deployment of wireless sensor and RFID (Radio Frequency IDentification) devices is one of the key enablers for next-generation pervasive computing applications, including large-scale environmental monitoring and control, context-aware computing, and “smart digital homes. Expand
  • 48
  • 3
  • PDF
Probabilistic Complex Event Triggering
TLDR
The key goal of pcet is to build an in-frastructure that can automatically infer andreason about the probabilities of triggeredevents, using a principled probabilistic modelfor the underlying sensor data. Expand
  • 5
  • PDF
Sketching with Partial Programs
TLDR
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. Expand
Extending the Applicability of Sketching
We present four extensions to the SKETCH programming system developed at UC Berkeley: (a) support for floating point numbers; (b) a new circuit-based solver; (c) performing synthesis and verificationExpand
  • 1
Symbolic Proof Generation for Resizing Sketches Gilad Arnold and
We propose an approach for resizing finite implementations generated by the SKETCH synthesis framework. Our solution generates a formal proof of equivalence between size-parameterized versions of aExpand