Information Processing Letters
Interprocedural slicing using dependence graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Slicing object-oriented software
Proceedings of the 18th international conference on Software engineering
Flow insensitive C++ pointers and polymorphism analysis and its application to slicing
ICSE '97 Proceedings of the 19th international conference on Software engineering
Static slicing of threaded programs
Proceedings of the 1998 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Programmers use slices when debugging
Communications of the ACM
Slicing object-oriented java programs
ACM SIGPLAN Notices
Slicing concurrent java programs
ACM SIGPLAN Notices
An efficient method for computing dynamic program slices
Information Processing Letters
An overview of methods for dependence analysis of concurrent programs
ACM SIGPLAN Notices
Java 2: The Complete Reference
Java 2: The Complete Reference
Dependence Analysis of Parallel and Distributed Programs and Its Applications
APDC '97 Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97)
Forward Dynamic Object-Oriented Program Slicing
ASSET '99 Proceedings of the 1999 IEEE Symposium on Application - Specific Systems and Software Engineering and Technology
Dynamic Slicing Object-Oriented Programs for Debugging
SCAM '02 Proceedings of the Second IEEE International Workshop on Source Code Analysis and Manipulation
Slicing Objects Using System Dependence Graphs
ICSM '98 Proceedings of the International Conference on Software Maintenance
Slicing Concurrent Java Programs
IWPC '99 Proceedings of the 7th International Workshop on Program Comprehension
The Compositional C++ Language Definition
The Compositional C++ Language Definition
Static Slicing of Concurrent Object-Oriented Programs
COMPSAC '96 Proceedings of the 20th Conference on Computer Software and Applications
Unions of Slices Are Not Slices
CSMR '03 Proceedings of the Seventh European Conference on Software Maintenance and Reengineering
A Novel Approach to Measuring Class Cohesion Based on Dependence Analysis
ICSM '02 Proceedings of the International Conference on Software Maintenance (ICSM'02)
Context-sensitive slicing of concurrent programs
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
Regression Testing for Web Applications Based on Slicing
COMPSAC '03 Proceedings of the 27th Annual International Conference on Computer Software and Applications
Generating fast code from concurrent program dependence graphs
Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Proceedings of the 26th International Conference on Software Engineering
Using Compressed Bytecode Traces for Slicing Java Programs
Proceedings of the 26th International Conference on Software Engineering
An Edge Marking Technique for Dynamic Slicing of Object-Oriented Programs
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
A graph coloring approach to slicing of object-oriented programs
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Constructing CDG for program with transfer statements
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 3
Contradictory graph colouring algorithm to compute slice of concurrent object-oriented programs
International Journal of Computational Vision and Robotics
Hi-index | 0.00 |
We propose a novel dynamic program slicing technique for concurrent object-oriented programs. Our technique uses a Concurrent System Dependence Graph (CSDG) as the intermediate program representation. We mark and unmark the edges in the CSDG appropriately as and when the dependencies arise and cease during run-time. We mark an edge when its associated dependence exists and unmark an edge when the dependence ceases to exist. Our approach eliminates the use of trace files. Another advantage of our approach is that when a request for a slice is made, it is already available. This appreciably reduces the response time of slicing commands.