There has been a lot of theoretical work regarding slicing in general, dynamic slicing of object-oriented programs speci Dynamic Slicing of Java Bytecode Programs Attila Szegedi and Tibor Gyimothy Dynamic slicing on Java bytecode traces. Java programs use four kinds invokemethods. Two them,invokevirtual invokeinterface,may vokedi. Dynamic Slicing of Java Bytecode Programs. Attila Szegedi, Tibor Gyim 2005 Article Bibliometrics Design and Implementation of Bytecode-based Java Slicing Read more about slicing, dynamic. Design and Implementation of Bytecode-based Java Slicing. Static and dynamic slicing (e.g., .
Dynamic slicing on Java bytecode traces. Summary maincontribution reportmethods dynamicslicing singlethreaded Java programs. Our slicer proceeds compactrepresentation bytecodetrace sourcecode level Javaclass
Dynamic Slicing of Java Bytecode Programs. Related Products. We have identified the following relevant lab reagents. Brought to you by AQnowledge, precision products for scientistsx. Cite. ULike uses cookies, some of which may already have been set.
You may. hide this message. Cite. ULike is a free online bibliography manager. Register. and you can start organising your references online. Tags. In SCAM '0.
Java under dynamic optimizations. A Static Slicing Tool for sequential Java programs. A Static Slicing Tool for Sequential Java Programs. It provides several forms of intermediate code foranalyzing and optimizing Java bytecode.
Proceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'0. Key: citeulike: 1.
Posts. Citation. To insert individual citation into a bibliography in a word- processor. People studying for Ph. Ds or in postdoctoral (postdoc) positions.
Distributed dynamic slicing of Java programs. Abstract. We propose a novel dynamic slicing technique for distributed Java programs. We first construct the intermediate representation of a distributed Java program in the form of a set of Distributed Program Dependence Graphs (DPDG).
We mark and unmark the edges of the DPDG appropriately as and when dependencies arise and cease during run- time. Our algorithm can run parallely on a network of computers, with each node in the network contributing to the dynamic slice in a fully distributed fashion. Our approach does not require any trace files to be maintained. Another advantage of our approach is that a slice is available even before a request for a slice is made. This appreciably reduces the response time of slicing commands.
We have implemented the algorithm in a distributed environment. The results obtained from our experiments show promise. Keywords. Program slicing; Dynamic slicing; Program dependence graph; Debugging; Object- oriented program; Multithreading; Java; Distributed programming. Copyright . All rights reserved.
Durga P. Mohapatra is a senior lecturer of computer science and engineering at National Institute of Technology (NIT), Rourkela. His research interests include software engineering and distributed computing. Rajeev Kumar is an associate professor of computer science and engineering at Indian Institute of Technology (IIT), Kharagpur. Prior to joining IIT, he worked for Birla Institute of Technology & Science (BITS), Pilani and Defence Research & Development Organization (DRDO). His main research interests include programming languages and software engineering, multimedia and embedded systems, and multiobjective combinatorial optimization. He is a member of ACM, senior member of IEEE, and a fellow of IETE.
Rajib Mall has been with the department computer science and engineering of IIT, Kharagpur for the last 1. He obtained his Bachelor’s, Master’s, and Ph. D. His primary research interests are in the areas of program analysis and program testing.
He is a senior member of IEEE.