Dynamic program slicing agarwal

The portal can access those files and use them to remember the user's data, such as their chosen settings screen view, interface language, etc. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes.

More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser. Agrawal's slicing algorithm circular program relied graph program structure Heuristic algorithms program dependence graph dynamic slicing slice algorithm arrival statements dependence relationship.

Submitting the report failed. Please, try again. If the error persists, contact the administrator by writing to support infona. You can change the active elements on the page buttons and links by pressing a combination of keys:. I accept. Polski English Login or register account. The Debug Slicing of Logic Programs. Acta Cybern. View 1 excerpt, cites methods.

A collection of program slicing. View 3 excerpts, cites methods and background. Debugging with dynamic slicing and backtracking. Dynamic Program Slicing. What is the best technique for fault localization? In a study of 37 real bugs and 37 injected faults in more than a dozen open source C programs, we compare the effectiveness of statistical … Expand.

Highly Influenced. View 4 excerpts, cites background. Two dimensional concurrent program debugging. A concurrent program fault can propagate both within a single task thread of control and between tasks, making fault localization difficult. We propose a two-dimensional approach and supporting … Expand. Dynamic slicing of computer programs.

Dynamic slicing in the presence of unconstrained pointers. View 5 excerpts. The relationship of slicing and debugging to program understanding. Software Fault Localization. Encyclopedia of Software Engineering. In this paper, we concern the problem of dynamic slicing of object-oriented programs which, to our knowledge, has not been addressed in the literatures. To solve this problem, we present the dynamic object-oriented dependence graph DODG which is an arc-classified digraph to explicitly represent various dynamic dependence between statement instances for a particular execution of an object-oriented program.

Based on the DODG, we present a two-phase backward algorithm for computing a dynamic slice of an object-oriented program. This is a preview of subscription content, access via your institution.

Ducasse M. A Pragmatic Survey of Automated Debugging. Korel B, Laski J. Dynamic Program Slicing. Information Processing Letters , , 29 : — Dynamic Slicing in the Presence of Unconstrained Pointers.

New York, Debugging with Dynamic Slicing and Backtracking. Software-Practice and Experience , , 23 6 : — Article Google Scholar. Slicing Object-Oriented Programs. Using Program Slicing in Software Maintenance.