Sciweavers

452 search results - page 2 / 91
» Finding bugs is easy
Sort
View
EUROSYS
2011
ACM
14 years 3 months ago
Finding complex concurrency bugs in large multi-threaded applications
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
Pedro Fonseca, Cheng Li, Rodrigo Rodrigues
86
Voted
ASPLOS
2010
ACM
15 years 6 months ago
A randomized scheduler with probabilistic guarantees of finding bugs
This paper presents a randomized scheduler for finding concurrency bugs. Like current stress-testing methods, it repeatedly runs a given test program with supplied inputs. Howeve...
Sebastian Burckhardt, Pravesh Kothari, Madanlal Mu...
88
Voted
ISSTA
2010
ACM
15 years 1 months ago
The Google FindBugs fixit
In May 2009, Google conducted a company wide FindBugs “fixit”. Hundreds of engineers reviewed thousands of FindBugs warnings, and fixed or filed reports against many of the...
Nathaniel Ayewah, William Pugh
CSCW
2011
ACM
14 years 6 months ago
"Not my bug!" and other reasons for software bug report reassignments
Bug reporting/fixing is an important social part of the software development process. The bug-fixing process inherently has strong inter-personal dynamics at play, especially in h...
Philip J. Guo, Thomas Zimmermann, Nachiappan Nagap...
110
Voted
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
15 years 5 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma