Sciweavers

3456 search results - page 666 / 692
» Byte Code Engineering
Sort
View
POPL
2005
ACM
16 years 2 months ago
Mutatis mutandis: safe and predictable dynamic software updating
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman,...
POPL
2003
ACM
16 years 2 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
132
Voted
STOC
2003
ACM
124views Algorithms» more  STOC 2003»
16 years 2 months ago
Extractors: optimal up to constant factors
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wi...
SIGMOD
2005
ACM
151views Database» more  SIGMOD 2005»
16 years 2 months ago
The 8 requirements of real-time stream processing
Applications that require real-time processing of high-volume data steams are pushing the limits of traditional data processing infrastructures. These stream-based applications in...
Michael Stonebraker, Ugur Çetintemel, Stanley B. ...
POPL
2010
ACM
15 years 11 months ago
On the Verification Problem for Weak Memory Models
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...