Sciweavers

11381 search results - page 457 / 2277
» Connectivity
Sort
View
POPL
2004
ACM
16 years 7 months ago
Separation and information hiding
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
Peter W. O'Hearn, Hongseok Yang, John C. Reynolds
CADE
2007
Springer
16 years 7 months ago
Encoding First Order Proofs in SAT
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
Todd Deshane, Wenjin Hu, Patty Jablonski, Hai Lin,...
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
16 years 7 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
PODS
2006
ACM
121views Database» more  PODS 2006»
16 years 7 months ago
On the efficiency of checking perfect privacy
Privacy-preserving query-answering systems answer queries while provably guaranteeing that sensitive information is kept secret. One very attractive notion of privacy is perfect p...
Ashwin Machanavajjhala, Johannes Gehrke
MOBISYS
2003
ACM
16 years 6 months ago
Full TCP/IP for 8-Bit Architectures
We describe two small and portable TCP/IP implementations fulfilling the subset of RFC1122 requirements needed for full host-to-host interoperability. Our TCP/IP implementations d...
Adam Dunkels