Dynamic Program Slicing of Agent-oriented Software

Slicing programs is an essential aspect of program development and maintenance. Because numerous statements might be discarded in the procedure of locating a bug, dynamic program slicing approaches are commonly utilized for debugging. Only the statements that have a consequence on the variable are included in a dynamic program slice with regard to that variable. Agent-oriented programming is a novel paradigm which uses agents as their basic entity. Agents are defined as an object which achieves an explicit action in an atmosphere known to it and responds to the variations. In this paper, a different approach for computation of relevant slices in agent-oriented programs is presented. We have taken a single-agent program as our working example. First, we have developed an intermediate representation for the agent-oriented program. Then, we have developed an algorithm based on dependencies among the nodes in the graph to compute slices.