Show simple item record

ReCrash: Making Crashes Reproducible

dc.date.accessioned2007-11-20T15:45:09Z
dc.date.accessioned2018-11-24T10:25:48Z
dc.date.available2007-11-20T15:45:09Z
dc.date.available2018-11-24T10:25:48Z
dc.date.issued2007-11-20en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/39639
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/39639
dc.description.abstractIt is difficult to fix a problem without being able to reproduce it.However, reproducing a problem is often difficult and time-consuming.This paper proposes a novel algorithm, ReCrash, that generatesmultiple unit tests that reproduce a given program crash.ReCrash dynamically tracks method calls during every execution of the target program. If the program crashes, ReCrash saves information about the relevant method calls and uses the saved information to create unit tests reproducing the crash.We present reCrashJ an implementation of ReCrash for Java. reCrashJ reproducedreal crashes from javac, SVNKit, Eclipse JDT, and BST. reCrashJ is efficient, incurring 13%-64% performance overhead. If this overhead is unacceptable, then reCrashJ has another mode that has negligible overhead until a crash occurs and 0%-1.7% overhead until a second crash, at which point the test cases are generated.en_US
dc.format.extent9 p.en_US
dc.relationMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratoryen_US
dc.relationen_US
dc.titleReCrash: Making Crashes Reproducibleen_US


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2007-054.pdf307.8Kbapplication/pdfView/Open
MIT-CSAIL-TR-2007-054.ps1.359Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record