IEEE Transactions on Software Engineering
Dynamic impact analysis: a cost-effective technique to enforce error-propagation
ISSTA '93 Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis
Empirical Software Engineering
Pruning dynamic slices with confidence
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Effects of context on program slicing
Journal of Systems and Software - Special issue: Selected papers from the 4th source code analysis and manipulation (SCAM 2004) workshop
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Efficiently monitoring data-flow test coverage
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Search based data sensitivity analysis applied to requirement engineering
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Measuring the strength of information flows in programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
Precisely Detecting Runtime Change Interactions for Evolving Software
ICST '10 Proceedings of the 2010 Third International Conference on Software Testing, Verification and Validation
The Probabilistic Program Dependence Graph and Its Application to Fault Diagnosis
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Predicting Data Dependences for Slice Inspection Prioritization
ISSREW '12 Proceedings of the 2012 IEEE 23rd International Symposium on Software Reliability Engineering Workshops
DUA-forensics: a fine-grained dependence analysis and instrumentation framework based on Soot
Proceedings of the 2nd ACM SIGPLAN International Workshop on State Of the Art in Java Program analysis
Hi-index | 0.00 |
Program slicing is a popular but imprecise technique for identifying which parts of a program affect or are affected by a particular value. A major reason for this imprecision is that slicing reports all program statements possibly affected by a value, regardless of how relevant to that value they really are. In this paper, we introduce quantitative slicing (q-slicing), a novel approach that quantifies the relevance of each statement in a slice. Q-slicing helps users and tools focus their attention first on the parts of slices that matter the most. We present two methods for quantifying slices and we show the promise of q-slicing for a particular application: predicting the impacts of changes.