Sciweavers

12519 search results - page 2347 / 2504
» Approximation Problems Categories
Sort
View
PLDI
2006
ACM
15 years 10 months ago
The Compressor: concurrent, incremental, and parallel compaction
The widely used Mark-and-Sweep garbage collector has a drawback in that it does not move objects during collection. As a result, large long-running realistic applications, such as...
Haim Kermany, Erez Petrank
PLDI
2006
ACM
15 years 10 months ago
A framework for unrestricted whole-program optimization
Procedures have long been the basic units of compilation in conventional optimization frameworks. However, procedures are typically formed to serve software engineering rather tha...
Spyridon Triantafyllis, Matthew J. Bridges, Easwar...
PLDI
2006
ACM
15 years 10 months ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa
145
Voted
PLDI
2006
ACM
15 years 10 months ago
Precise alias analysis for static detection of web application vulnerabilities
The number and the importance of web applications have increased rapidly over the last years. At the same time, the quantity and impact of security vulnerabilities in such applica...
Nenad Jovanovic, Christopher Kruegel, Engin Kirda
174
Voted
PODC
2006
ACM
15 years 10 months ago
Self-stabilizing byzantine agreement
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
Ariel Daliot, Danny Dolev
« Prev « First page 2347 / 2504 Last » Next »