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
Slicing, Chopping, and Path Conditions with Barriers
Software Quality Control
Analysis and Visualization of Predicate Dependence on Formal Parameters and Global Variables
IEEE Transactions on Software Engineering
A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
Program Slicing with Dynamic Points-To Sets
IEEE Transactions on Software Engineering
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
Efficient path conditions in dependence graphs for software safety analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
An empirical study of static program slice size
ACM Transactions on Software Engineering and Methodology (TOSEM)
Empirical study of optimization techniques for massive slicing
ACM Transactions on Programming Languages and Systems (TOPLAS)
An approach for the maintenance of input validation
Information and Software Technology
Locating dependence structures using search-based slicing
Information and Software Technology
Precise slicing of concurrent programs
Automated Software Engineering
Advanced chopping of sequential and concurrent programs
Software Quality Control
Security framework to verify the low level implementation codes
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Impact analysis for distributed event-based systems
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
| Hi-index | 0.00 |
We present an empirical evaluation of three context-sensitiveslicing algorithms and five context-sensitive chop-pingalgorithms, and compare them to context-insensitivemethods. Besides the algorithms by Reps et al. and Agrawalwe investigate six new algorithms based on variations of k-limitedcall strings and approximative chopping based onsummary information. It turns out that chopping based onsummary information may have a prohibitive complexity,and that approximate algorithms are almost as precise andmuch faster.