Sciweavers

497 search results - page 92 / 100
» Essentials of the Java Programming Language, Part 1
Sort
View
PPOPP
2012
ACM
12 years 3 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
ASPLOS
2010
ACM
14 years 3 months ago
SherLog: error diagnosis by connecting clues from run-time logs
Computer systems often fail due to many factors such as software bugs or administrator errors. Diagnosing such production run failures is an important but challenging task since i...
Ding Yuan, Haohui Mai, Weiwei Xiong, Lin Tan, Yuan...
ASIAN
2006
Springer
118views Algorithms» more  ASIAN 2006»
13 years 12 months ago
An Approach to Formal Verification of Arithmetic Functions in Assembly
Abstract. It is customary to write performance-critical parts of arithmetic functions in assembly: this enables finely-tuned algorithms that use specialized processor instructions....
Reynald Affeldt, Nicolas Marti
ACSAC
2001
IEEE
13 years 12 months ago
Genoa TIE, Advanced Boundary Controller Experiment
This document describes experimentation performed as part of the Genoa Technology Integration Experiment (TIE). Achieved in two phases, the overarching assertion of the Genoa TIE ...
Eric Monteith
JOOP
1998
86views more  JOOP 1998»
13 years 7 months ago
Prelude to a Theory of Void
A set of rules to ascertain that in calls of the form x.f (...) there will always be an object attached to x. 1 PURPOSE The theory developed in this article investigates void call...
Bertrand Meyer