Sciweavers

1419 search results - page 260 / 284
» Notes on Formalizing Context
Sort
View
201
Voted
POPL
2008
ACM
16 years 24 days ago
Boomerang: resourceful lenses for string data
A lens is a bidirectional program. When read from left to right, it denotes an ordinary function that maps inputs to outputs. When read from right to left, it denotes an "upd...
Aaron Bohannon, J. Nathan Foster, Benjamin C. Pier...
204
Voted
POPL
2005
ACM
16 years 24 days ago
Polymorphic bytecode: compositional compilation for Java-like languages
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
Davide Ancona, Ferruccio Damiani, Sophia Drossopou...
113
Voted
CADE
2007
Springer
16 years 24 days ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
16 years 24 days ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
97
Voted
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
16 years 19 days ago
Query Optimization In Compressed Database Systems
Over the last decades, improvements in CPU speed have outpaced improvements in main memory and disk access rates by orders of magnitude, enabling the use of data compression techn...
Zhiyuan Chen, Johannes Gehrke, Flip Korn