Efficient simulation of synthesis-oriented system level designs
Proceedings of the 15th international symposium on System Synthesis
A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
Combining algorithmic debugging and program slicing
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Empirical study of optimization techniques for massive slicing
ACM Transactions on Programming Languages and Systems (TOPLAS)
BitBlaze: A New Approach to Computer Security via Binary Analysis
ICISS '08 Proceedings of the 4th International Conference on Information Systems Security
Program transformations for information personalization
Computer Languages, Systems and Structures
Efficient, sensitivity resistant binary instrumentation
Proceedings of the 2011 International Symposium on Software Testing and Analysis
A vocabulary of program slicing-based techniques
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
A new method for extracting partial representations of a program is described. Given two sets of variable instances, source and sink, a graph is constructed showing the statements that cause definitions of source to affect uses of sink. This criterion can express a wider range of queries than the various forms of slice criteria, which it subsumes as special cases. On the standard slice criterion (backward slicing from a use or definition) it produces better reults than existing algorithms. The method is modular. By treating all statements abstractly as def-use relations, it can present a procedure call as simple statement, so that it appears in the graph as a single node whose role may be understood without looking beyond the context of the call.