Sciweavers

3384 search results - page 69 / 677
» More Testable Properties
Sort
View
MPC
1995
Springer
91views Mathematics» more  MPC 1995»
14 years 8 days ago
A Refinement Relation Supporting the Transition from Unbounded to Bounded Communication Buffers
This paper proposes a refinement relation supporting the transition from unbounded to bounded communication buffers. Employing this refinement relation, a system specification base...
Ketil Stølen
CRYPTO
2008
Springer
123views Cryptology» more  CRYPTO 2008»
13 years 10 months ago
Collusion-Free Protocols in the Mediated Model
Prior approaches [15, 14] to building collusion-free protocols require exotic channels. By taking a conceptually new approach, we are able to use a more digitally-friendly communic...
Joël Alwen, Abhi Shelat, Ivan Visconti
PODS
2012
ACM
240views Database» more  PODS 2012»
11 years 11 months ago
Approximate computation and implicit regularization for very large-scale data analysis
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
Michael W. Mahoney
DRM
2007
Springer
14 years 2 months ago
Digital rights management: desirable, inevitable, and almost irrelevant
provides a very brief overview of some of the main points. References are given to my papers, where those points are explained in more detail, and citations are provided to the ext...
Andrew M. Odlyzko
ACTA
2010
109views more  ACTA 2010»
13 years 9 months ago
On regular temporal logics with past
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
Christian Dax, Felix Klaedtke, Martin Lange