Sciweavers

1941 search results - page 339 / 389
» On the Hardness of Approximate Reasoning
Sort
View
AOSD
2010
ACM
15 years 6 months ago
Tracking code patterns over multiple software versions with Herodotos
An important element of understanding a software code base is to identify the repetitive patterns of code it contains and how these evolve over time. Some patterns are useful to t...
Nicolas Palix, Julia L. Lawall, Gilles Muller
ASPLOS
2010
ACM
15 years 6 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...
ASPLOS
2010
ACM
15 years 6 months ago
Analyzing multicore dumps to facilitate concurrency bug reproduction
Debugging concurrent programs is difficult. This is primarily because the inherent non-determinism that arises because of scheduler interleavings makes it hard to easily reproduc...
Dasarath Weeratunge, Xiangyu Zhang, Suresh Jaganna...
ISPD
2010
ACM
195views Hardware» more  ISPD 2010»
15 years 6 months ago
Density gradient minimization with coupling-constrained dummy fill for CMP control
In the nanometer IC design, dummy fill is often performed to improve layout pattern uniformity and the post-CMP quality. However, filling dummies might greatly increase intercon...
Huang-Yu Chen, Szu-Jui Chou, Yao-Wen Chang
SAC
2010
ACM
15 years 6 months ago
Performance analysis of FlexRay-based systems using real-time calculus, revisited
The FlexRay protocol [4] is likely to be the de facto standard for automotive communication systems. Hence, there is a need to provide hard performance guarantees on properties li...
Devesh B. Chokshi, Purandar Bhaduri