A Novel Approach of Forward Dynamic Slicing
| dc.contributor.author | Goyal, Deepak | |
| dc.contributor.supervisor | Verma, Karun | |
| dc.contributor.supervisor | Bhatia, Rajesh | |
| dc.date.accessioned | 2011-07-21T08:41:19Z | |
| dc.date.available | 2011-07-21T08:41:19Z | |
| dc.date.issued | 2011-07-21T08:41:19Z | |
| dc.description | M.E. (Software Engineering) | en |
| dc.description.abstract | Program slicing is a deduction technique, which identifies relevant statements that are related to given function or variable at the point of interest in given program. It is used to decompose and filter a large program to restrict the focus on specific parts of program. Program slicing is used in various software engineering activities including program understanding, software testing, software debugging, software maintenance, complexity measurement and reverse engineering etc. Dynamic slicing is a type of program slicing, which contains all statements that actually affect the value of a variable at the point of interest for a particular execution of the program and forward slice contains all statements that might be influenced by the variable. A new approach of forward dynamic slicing is introduced in this thesis, which computes forward dynamic slices of programs at execution time without recording program execution trace. So this approach reduces space complexity problem, which occurs due to the storage of program‘s execution trace. The approach presented in this thesis has been implemented in C# on window platform. | en |
| dc.format.extent | 597644 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/10266/1419 | |
| dc.language.iso | en | en |
| dc.subject | Dynamic Slicing | en |
| dc.subject | SDG, | en |
| dc.subject | PDG | en |
| dc.subject | Slicing | en |
| dc.subject | Testing | en |
| dc.title | A Novel Approach of Forward Dynamic Slicing | en |
| dc.type | Thesis | en |