A compact execution history for dynamic slicing
References (12)
- et al.
Dynamic program slicing
Inform. Process. Lett.
(1988) - et al.
Dynamic program slicing
ACM SIGPLAN Notices
(1990) - et al.
Compilers—Principles, Techniques and Tools
(1986) An efficient way to find the side effect of procedure calls and aliases of variables
- et al.
Interprocedural side-effect analysis in linear time
ACM SIGPLAN Notices
(1988) - et al.
Poor man's watchpoints
ACM SIGPLAN Notices
(1995)
There are more references available in the full text version of this article.
Cited by (9)
Application of Dynamic Slicing in Test Data Generation
2007, Tsinghua Science and TechnologyAn efficient interprocedural dynamic slicing method
2006, Journal of Systems and SoftwareCitation Excerpt :Storing the execution history is another major disadvantage of this approach, since file access is a very slow operation and can considerably slow down the response time of a dynamic slicer. Other relevant dynamic slicing algorithms based on execution history are reported in Beszédes et al. (2001), Dhamdhere et al. (2003), Huynh and Song (1997), Korel and Laski (1990, 1994, 1997) and Zhang et al. (2003). Several methods for computing dynamic slices using dependence graphs have been reported (Agrawal and Horgan, 1990, 1991a; Gopal, 1991; Goswami and Mall, 2002; Kamkar et al., 1992, 1993a,b; Mund et al., 2002a, 2003; Mund, 2003).
Lossless compaction of model execution traces
2020, Software and Systems ModelingTowards a tracing framework for Model-Driven software systems
2016, 2016 6th International Conference on Computer and Knowledge Engineering, ICCKE 2016Slicing Object-Oriented programs with exception handling structures
2012, Advanced Materials ResearchDynamic slicing on Java bytecode traces
2008, ACM Transactions on Programming Languages and Systems
Copyright © 2002 Elsevier Science B.V. All rights reserved.