Sciweavers

118 search results - page 23 / 24
» Verifying Correctness of Transactional Memories
Sort
View
IAW
2003
IEEE
14 years 19 days ago
Insecure Programming: How Culpable is a Language's Syntax?
— Vulnerabilities in software stem from poorly written code. Inadvertent errors may creep in due to programmers not being aware of the security implications of their code. Writin...
Ramkumar Chinchani, Anusha Iyer, Bharat Jayaraman,...
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
14 years 7 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
SAC
2008
ACM
13 years 6 months ago
Offline count-limited certificates
In this paper, we present the idea of offline count-limited certificates (or clics for short), and show how these can be implemented using minimal trusted hardware functionality a...
Luis F. G. Sarmenta, Marten van Dijk, Jonathan Rho...
WWW
2004
ACM
14 years 8 months ago
Securing web application code by static analysis and runtime protection
Security remains a major roadblock to universal acceptance of the Web for many kinds of transactions, especially since the recent sharp increase in remotely exploitable vulnerabil...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
ISCA
2012
IEEE
232views Hardware» more  ISCA 2012»
11 years 9 months ago
RADISH: Always-on sound and complete race detection in software and hardware
Data-race freedom is a valuable safety property for multithreaded programs that helps with catching bugs, simplifying memory consistency model semantics, and verifying and enforci...
Joseph Devietti, Benjamin P. Wood, Karin Strauss, ...