Sciweavers

5090 search results - page 603 / 1018
» Constructing Strategies for Programming
Sort
View
TON
2012
13 years 9 months ago
A Game-Theoretic Approach to Anonymous Networking
—Anonymous wireless networking is studied when an adversary monitors the transmission timing of an unknown subset of the network nodes. For a desired quality of service (QoS), as...
Parvathinathan Venkitasubramaniam, Lang Tong
POPL
2006
ACM
16 years 7 months 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
PLDI
2006
ACM
16 years 24 days ago
SAFECode: enforcing alias analysis for weakly typed languages
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...
Dinakar Dhurjati, Sumant Kowshik, Vikram S. Adve
PLDI
2003
ACM
16 years 2 days ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
SODA
2003
ACM
114views Algorithms» more  SODA 2003»
15 years 8 months ago
Lower bounds for collusion-secure fingerprinting
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
Chris Peikert, Abhi Shelat, Adam Smith