Dynamic Slicing on Java Bytecode Traces
| dc.contributor.author | WANG, Tao | en_US |
| dc.contributor.author | ROYCHOUDHURY, Abhik | en_US |
| dc.date.accessioned | 2007-03-21T09:47:27Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:21Z | |
| dc.date.available | 2007-03-21T09:47:27Z | en_US |
| dc.date.available | 2017-01-23T07:00:21Z | |
| dc.date.issued | 2007-03-19 | en_US |
| dc.description.abstract | Dynamic slicing is a well-known technique for program analysis, debugging and understanding. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some variables' occurrences when P is executed with I. In this paper, we develop a dynamic slicing method for sequential Java programs. Our technique proceeds by backwards traversal of the bytecode trace produced by an input I in a given program P. Since such traces can be huge, we use results from data compression to compactly represent bytecode traces. The major space savings in our method come from the optimized representation of (a) data addresses used as operands by memory reference bytecodes, and (b) instruction addresses used as operands by control transfer bytecodes. We show how dynamic slicing algorithms can directly traverse our compact bytecode traces without resorting to costly decompression. We also extend our dynamic slicing algorithm to perform ``relevant slicing''; th... | en_US |
| dc.format.extent | 1616154 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/2318 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TRB3/07 | en_US |
| dc.subject | Program Slicing | en_US |
| dc.subject | Tracing | en_US |
| dc.subject | Debugging | en_US |
| dc.title | Dynamic Slicing on Java Bytecode Traces | en_US |
| dc.type | Technical Report | en_US |