[{"type":"paper-conference","title":"Evaluating Context-Sensitive Slicing and Chopping","issued":{"date-parts":[["2002"]]},"page":"22 - 31","container-title":"Proceedings \/ International Conference on Software Maintenance : October 3 - 6, 2002, Montreal, Quebec, Canada","author":[{"family":"Krinke","given":"Jens"}],"publisher":"IEEE Computer Soc.","publisher-place":"Los Alamitos (Calif.)","ISBN":"0-7695-1819-2","abstract":"We present an empirical evaluation of three context-sensitive slicing algorithms and five context-sensitive chopping algorithms, and compare them to context-insensitive methods. Besides the algorithms by Reps et al. and Agrawal we investigate six new algorithms based on variations of k-limited call strings and approximative chopping based on summary information. It turns out that chopping based on summary information may have a prohibitive complexity, and that approximate algorithms are almost as precise and much faster.","kit-publication-id":"1000017625"}]