Sciweavers

3081 search results - page 589 / 617
» A Formal Ontology of Properties
Sort
View
CAV
2009
Springer
133views Hardware» more  CAV 2009»
16 years 10 days ago
Cardinality Abstraction for Declarative Networking Applications
ity Abstraction for Declarative Networking Applications Juan A. Navarro P?erez, Andrey Rybalchenko, and Atul Singh Max Planck Institute for Software Systems (MPI-SWS) Declarative N...
Andrey Rybalchenko, Atul Singh, Juan Antonio Navar...
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 10 days ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
16 years 5 days ago
Predicting customer shopping lists from point-of-sale purchase data
This paper describes a prototype that predicts the shopping lists for customers in a retail store. The shopping list prediction is one aspect of a larger system we have developed ...
Chad M. Cumby, Andrew E. Fano, Rayid Ghani, Marko ...
POPL
2008
ACM
16 years 2 days ago
Multiparty asynchronous session types
Communication is becoming one of the central elements in software development. As a potential typed foundation for structured communication-centred programming, session types have...
Kohei Honda, Nobuko Yoshida, Marco Carbone
POPL
2006
ACM
16 years 2 days ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam