Sciweavers

2714 search results - page 200 / 543
» On the Notion of Value Object
Sort
View
SAS
2007
Springer
16 years 19 days ago
Program Analysis Using Symbolic Ranges
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
Sriram Sankaranarayanan, Franjo Ivancic, Aarti Gup...
COMPGEOM
2006
ACM
16 years 15 days ago
Lower bounds on locality sensitive hashing
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
Rajeev Motwani, Assaf Naor, Rina Panigrahy
DSN
2005
IEEE
16 years 4 days ago
Defeating Memory Corruption Attacks via Pointer Taintedness Detection
Most malicious attacks compromise system security through memory corruption exploits. Recently proposed techniques attempt to defeat these attacks by protecting program control da...
Shuo Chen, Jun Xu, Nithin Nakka, Zbigniew Kalbarcz...
CSFW
2003
IEEE
15 years 12 months ago
Probabilistic Noninterference through Weak Probabilistic Bisimulation
To be practical, systems for ensuring secure information flow must be as permissive as possible. To this end, the author recently proposed a type system for multi-threaded progra...
Geoffrey Smith
ICEIS
2003
IEEE
15 years 11 months ago
Distributed Overload Control for Real-Time Replicated Database Systems
: In order to meet their temporal constraints, current applications such as Web-based services and electronic commerce use the technique of data replication. To take the replicatio...
Samia Saad-Bouzefrane, Claude Kaiser