Sciweavers

587 search results - page 40 / 118
» Algorithmic Debugging of Java Programs
Sort
View
KBSE
2005
IEEE
14 years 1 months ago
Automatic test factoring for java
Test factoring creates fast, focused unit tests from slow system-wide tests; each new unit test exercises only a subset of the functionality exercised by the system test. Augmenti...
David Saff, Shay Artzi, Jeff H. Perkins, Michael D...
AADEBUG
2005
Springer
14 years 1 months ago
Experimental evaluation of using dynamic slices for fault location
Dynamic slicing algorithms have been considered to aid in debugging for many years. However, as far as we know, no detailed studies on evaluating the benefits of using dynamic sl...
Xiangyu Zhang, Haifeng He, Neelam Gupta, Rajiv Gup...
SCAM
2007
IEEE
14 years 2 months ago
An Evaluation of Slicing Algorithms for Concurrent Programs
Program slicing is a program-reduction technique for extracting statements that may influence other statements. While there exist efficient algorithms to slice sequential progra...
Dennis Giffhorn, Christian Hammer
TACAS
2007
Springer
141views Algorithms» more  TACAS 2007»
14 years 1 months ago
JPF-SE: A Symbolic Execution Extension to Java PathFinder
We present JPF–SE, an extension to the Java PathFinder Model Checking framework (JPF) that enables the symbolic execution of Java programs. JPF–SE uses JPF to generate and expl...
Saswat Anand, Corina S. Pasareanu, Willem Visser
SIGSOFT
2003
ACM
14 years 8 months ago
Context-sensitive slicing of concurrent programs
Program slicing is a technique to identify statements that may influence the computations at other statements. Precise slicing has been shown to be undecidable for concurrent prog...
Jens Krinke