Sciweavers

1051 search results - page 146 / 211
» Protocols in the use of empirical software engineering artif...
Sort
View
ISSTA
2010
ACM
13 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
SIGSOFT
2010
ACM
13 years 6 months ago
A trace simplification technique for effective debugging of concurrent programs
Concurrent programs are notoriously difficult to debug. We see two main reasons for this: 1) concurrency bugs are often difficult to reproduce, 2) traces of buggy concurrent execu...
Nicholas Jalbert, Koushik Sen
ICFEM
2010
Springer
13 years 7 months ago
Making the Right Cut in Model Checking Data-Intensive Timed Systems
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
Rüdiger Ehlers, Michael Gerke 0002, Hans-J&ou...
ISSTA
2009
ACM
14 years 3 months ago
Advanced code coverage analysis using substring holes
Code coverage is a common aid in the testing process. It is generally used for marking the source code segments that were executed and, more importantly, those that were not execu...
Yoram Adler, Eitan Farchi, Moshe Klausner, Dan Pel...
CHI
1993
ACM
14 years 1 months ago
Reducing the variability of programmers' performance through explained examples
A software tool called EXPLAINER has been developed for helping programmers perform new tasks by exploring previously worked-out examples. EXPLAINER is based on cognitive principl...
David F. Redmiles