David Insa
Josep Silva
ABSTRACT
Program slicing is a technique to extract the part of a program (the slice) that influences or is influenced by a set of variables at a given point. Computing minimal slices is undecidable in the general case, and obtaining the minimal slice of a given program is computationally prohibitive even for very small programs. Hence, no matter what program sheer we use, in general, we cannot be sure that our slices are minimal. In this work, we present a method to automatically produce a new notion of slice that we call super reduced slice because it is constructed with the combination of different slicing techniques, including the composition of standard program sheers.
- D. Binkley and K. B. Gallagher. Program Slicing. Advances in Computers, 43(2):1--50, apr 1996. Google Scholar
Cross Ref
- D. Binkley, N. Gold, M. Harman, S. Islam, J. Krinke, and S. Yoo. ORBS: Language-independent Program Slicing. In Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering, FSE 2014, pages 109--120, New York, NY, USA, 2014. ACM. Google ScholarDigital Library
- R. A. DeMillo, H. Pan, and E. H. Spafford. Critical slicing for software fault localization. SIGSOFT Softw. Eng. Notes, 21(3):121--134, may 1996. Google ScholarDigital Library
- A. Giantsios, N. Papaspyrou, and K. Sagonas. Concolic testing for functional languages. In Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming (PPDP '15), pages 137--148. ACM, 2015. Google ScholarDigital Library
- A. Hajnal and I. Forgács. A demand-driven approach to slicing legacy COBOL systems. Journal of Software Maintenance, 24(1):67--82, 2012. Google ScholarCross Ref
- S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM Transactions Programming Languages and Systems, 12(1):26--60, 1990. Google ScholarDigital Library
- A. Majumdar, S. J. Drape, and C. D. Thomborson. Slicing obfuscations: Design, correctness, and evaluation. In Proceedings of the 2007 ACM Workshop on Digital Rights Management, DRM '07, pages 70--81, New York, NY, USA, 2007. ACM. Google ScholarDigital Library
- C. Ochoa, J. Silva, and G. Vidal. Lightweight program specialization via Dynamic Slicing. In Proceedings of the 2005 ACM SIGPLAN Workshop on Curry and Functional Logic Programming, WCFLP '05, pages 1--7, New York, NY, USA, 2005. ACM. Google ScholarDigital Library
- J. Silva. A vocabulary of Program Slicing-based techniques. ACM Computing Surveys, 44(3), 2012. Google ScholarDigital Library
- J. Silva, S. Tamarit, and C. Tomás. System Dependence Graphs in sequential Erlang. In Proceedings of the 15th International Conference on Fundamental Approaches to Software Engineering (FASE 2012), volume 7212 of Lecture Notes in Computer Science, pages 486--500. Springer, 2012. Google ScholarDigital Library
- J. Silva, S. Tamarit, C. Tomás, and D. Insa. Slicerl, September 2011.Google Scholar
- F. Tip. A survey of Program Slicing techniques. Journal of Programming Languages, 3(3):121--189, 1995.Google Scholar
- M. Weiser. Program Slicing. In Proceedings of the 5th international conference on Software engineering (ICSE '81), pages 439--449, Piscataway, NJ, USA, 1981. IEEE Press. Google ScholarDigital Library
Index Terms
- Computing super reduced program slices by composing slicing techniques
Recommendations
Abstract Program Slicing: An Abstract Interpretation-Based Approach to Program Slicing
In the present article, we formally define the notion of abstract program slicing, a general form of program slicing where properties of data are considered instead of their exact value. This approach is applied to a language with numeric and reference ...
A brief survey of program slicing
Program slicing is a technique to extract program parts with respect to some special computation. Since Weiser first proposed the notion of slicing in 1979, hundreds of papers have been presented in this area. Tens of variants of slicing have been ...
Abstract program slicing: from theory towards an implementation
ICFEM'10: Proceedings of the 12th international conference on Formal engineering methods and software engineeringIn this paper we extend the formal framework proposed by Binkley et al. for representing and comparing forms of program slicing. This framework describes many well-known forms of slicing in a unique formal structure based on (abstract) projections of ...
Comments