The program dependence graph and its use in optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
The relationship between slices and module cohesion
ICSE '89 Proceedings of the 11th international conference on Software engineering
Interprocedural slicing using dependence graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Using Program Slicing in Software Maintenance
IEEE Transactions on Software Engineering
Incremental program testing using program dependence graphs
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A new model of program dependences for reverse engineering
SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
Precise interprocedural chopping
SIGSOFT '95 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
Program and interface slicing for reverse engineering
ICSE '93 Proceedings of the 15th international conference on Software Engineering
Benefits of a data flow-aware programming environment
Proceedings of the 1999 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Making slicing practical: the final mile
PASTE '01 Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Efficient path conditions in dependence graphs
Proceedings of the 24th International Conference on Software Engineering
IEEE Transactions on Software Engineering
ICSM '96 Proceedings of the 1996 International Conference on Software Maintenance
Combining Slicing and Constraint Solving for Validation of Measurement Software
SAS '96 Proceedings of the Third International Symposium on Static Analysis
Intermodular Slicing of Object-oriented Programs
CC '98 Proceedings of the 7th International Conference on Compiler Construction
Computational Geometry Problems in REDLOG
Selected Papers from the International Workshop on Automated Deduction in Geometry
Understanding Function Behaviors through Program Slicing
WPC '96 Proceedings of the 4th International Workshop on Program Comprehension (WPC '96)
Incremental Slicing Based on Data-Dependences Types
ICSM '01 Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01)
ConSIT: A Conditioned Program Slicer
ICSM '00 Proceedings of the International Conference on Software Maintenance (ICSM'00)
Unions of Slices Are Not Slices
CSMR '03 Proceedings of the Seventh European Conference on Software Maintenance and Reengineering
Evaluating Context-Sensitive Slicing and Chopping
ICSM '02 Proceedings of the International Conference on Software Maintenance (ICSM'02)
Program slices: formal, psychological, and practical investigations of an automatic program abstraction method
Leveraging field data for impact analysis and regression testing
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
CONSIT: a fully automated conditioned program slicer
Software—Practice & Experience
Visualization of Program Dependence and Slices
ICSM '04 Proceedings of the 20th IEEE International Conference on Software Maintenance
A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
Efficient path conditions in dependence graphs for software safety analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
Trading-off security and performance in barrier slicing for remote software entrusting
Automated Software Engineering
A vocabulary of program slicing-based techniques
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
One of the critiques on program slicing is that slices presented to the user are hard to understand. This is mainly related to the problem that slicing ‘dumps’ the results onto the user without any explanation. This work will present an approach that can be used to ‘filter’ slices. This approach basically introduces ‘barriers’ which are not allowed to be passed during slice computation. An earlier filtering approach is chopping which is also extended to obey such a barrier. The barrier variants of slicing and chopping provide filtering possibilities for smaller slices and better comprehensibility. The concept of barriers is then applied to path conditions, which provide necessary conditions under which an influence between the source and target criterion exists. Barriers make those conditions more precise.