Sciweavers

50 search results - page 10 / 10
» DieHarder: securing the heap
Sort
View
OOPSLA
1999
Springer
13 years 10 months ago
Compositional Pointer and Escape Analysis for Java Programs
This paper presents a combined pointer and escape analysis algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize ho...
John Whaley, Martin C. Rinard
OOPSLA
1998
Springer
13 years 9 months ago
JRes: A Resource Accounting Interface for Java
With the spread of the Internet the computing model on server systems is undergoing several important changes. Recent research ideas concerning dynamic operating system extensibil...
Grzegorz Czajkowski, Thorsten von Eicken
PST
2004
13 years 7 months ago
Syntax-based Vulnerability Testing of Frame-based Network Protocols
Syntax-based vulnerability testing is a static black-box testing method for protocol implementations. It involves testing the Implementation Under Test (IUT) with a large number o...
Oded Tal, Scott Knight, Tom Dean
IANDC
2006
77views more  IANDC 2006»
13 years 5 months ago
Lower and upper bounds on obtaining history independence
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
Niv Buchbinder, Erez Petrank
ICFP
2010
ACM
13 years 5 months ago
A certified framework for compiling and executing garbage-collected languages
We describe the design, implementation, and use of a machinecertified framework for correct compilation and execution of programs in garbage-collected languages. Our framework ext...
Andrew McCreight, Tim Chevalier, Andrew P. Tolmach