Sciweavers

15 search results - page 3 / 3
» Arithmetical Sacks Forcing
Sort
View
FORMATS
2010
Springer
13 years 5 months ago
Natural Domain SMT: A Preliminary Assessment
SMT solvers have traditionally been based on the DPLL(T) algorithm, where the driving force behind the procedure is a DPLL search over truth valuations. This traditional framework ...
Scott Cotton
FUN
2007
Springer
98views Algorithms» more  FUN 2007»
14 years 1 months ago
Die Another Day
The Hydra was a many-headed monster from Greek mythology that would immediately replace a head that was cut off by one or two new heads. It was the ask of Hercules to kill this mon...
Rudolf Fleischer
IACR
2011
212views more  IACR 2011»
12 years 7 months ago
Fully Homomorphic Encryption without Bootstrapping
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
Zvika Brakerski, Craig Gentry, Vinod Vaikuntanatha...
POPL
2010
ACM
14 years 4 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
JNSM
2008
130views more  JNSM 2008»
13 years 7 months ago
Declarative Infrastructure Configuration Synthesis and Debugging
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...
Sanjai Narain, Gary Levin, Sharad Malik, Vikram Ka...