Sciweavers

Share
ISSTA
2010
ACM
9 years 9 months ago
Robust non-intrusive record-replay with processor extraction
With the advent of increasingly larger parallel machines, debugging is becoming more and more challenging. In particular, applications at this scale tend to behave non-determinist...
Filippo Gioachin, Gengbin Zheng, Laxmikant V. Kal&...
ISSTA
2010
ACM
9 years 9 months ago
A platform for search-based testing of concurrent software
The paper describes a generic, open-source infrastructure called SearchBestie (or S'Bestie for short) that we propose as a platform for experimenting with search-based techni...
Bohuslav Krena, Zdenek Letko, Tomás Vojnar,...
ISSTA
2010
ACM
9 years 9 months ago
Automatically identifying critical input regions and code in applications
Applications that process complex inputs often react in different ways to changes in different regions of the input. Small changes to forgiving regions induce correspondingly smal...
Michael Carbin, Martin C. Rinard
ISSTA
2010
ACM
9 years 11 months ago
Analysis of invariants for efficient bounded verification
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
Juan P. Galeotti, Nicolás Rosner, Carlos L&...
ISSTA
2010
ACM
9 years 11 months ago
Generating test cases for specification mining
Valentin Dallmeier, Nikolai Knopp, Christoph Mallo...
ISSTA
2010
ACM
9 years 11 months ago
OCAT: object capture-based automated testing
Testing object-oriented (OO) software is critical because OO languages are commonly used in developing modern software systems. In testing OO software, one important and yet chall...
Hojun Jaygarl, Sunghun Kim, Tao Xie, Carl K. Chang
ISSTA
2010
ACM
9 years 11 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
ISSTA
2010
ACM
9 years 11 months ago
Exploiting program dependencies for scalable multiple-path symbolic execution
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
Raúl A. Santelices, Mary Jean Harrold
ISSTA
2010
ACM
9 years 11 months ago
Perturbing numerical calculations for statistical analysis of floating-point program (in)stability
Writing reliable software is difficult. It becomes even more difficult when writing scientific software involving floating-point numbers. Computers provide numbers with limite...
Enyi Tang, Earl T. Barr, Xuandong Li, Zhendong Su
ISSTA
2010
ACM
9 years 11 months ago
Causal inference for statistical fault localization
This paper investigates the application of causal inference methodology for observational studies to software fault localization based on test outcomes and profiles. This methodo...
George K. Baah, Andy Podgurski, Mary Jean Harrold
books