Sciweavers

14824 search results - page 2807 / 2965
» Security - Introduction
Sort
View
POPL
2006
ACM
15 years 11 months ago
Verifying properties of well-founded linked lists
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
Shuvendu K. Lahiri, Shaz Qadeer
POPL
2006
ACM
15 years 11 months ago
The essence of command injection attacks in web applications
Web applications typically interact with a back-end database to retrieve persistent data and then present the data to the user as dynamically generated output, such as HTML web pa...
Zhendong Su, Gary Wassermann
POPL
2004
ACM
15 years 11 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
15 years 11 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
OSDI
2006
ACM
15 years 11 months ago
Flight Data Recorder: Monitoring Persistent-State Interactions to Improve Systems Management
Mismanagement of the persistent state of a system--all the executable files, configuration settings and other data that govern how a system functions--causes reliability problems,...
Chad Verbowski, Emre Kiciman, Arunvijay Kumar, Bra...
« Prev « First page 2807 / 2965 Last » Next »