Interprocedural Conditioned Slicing

Conference paper
First Online:
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 556)

Abstract

A technique, named Node Marking Conditioned Slicing (NMCS) algorithm, has been proposed to compute conditioned slices for interprocedural programs. First, the System Dependence Graph (SDG) is constructed as an intermediate representation of a given program. Then, NMCS algorithm selects the nodes satisfying a given condition by marking process and computes the conditioned slices for each variable at each statement during marking process. A stack has been used in NMCS algorithm to preserve the context in which a method is called. Some edges of SDG have been labeled to signify which statement calls a method.

Keywords

Conditioned slicing Conditioned slice Node Marking Conditioned Slicing (NMCS) algorithm 
This is a preview of subscription content, log in to check access.

References

  1. 1.
    Gerardo Canfora, Aniello Cimitile and Andrea De Lucia. Conditioned Program Slicing, Information and Software Technology, Vol. 40, No. 11–12, pp. 595–607, December 1998.Google Scholar
  2. 2.
    Sebastian Danicic, Chris Fox, Mark Harman and Rob Hierons. ConSIT: A Conditioned Program Slicer. In proceedings of International Conference on Software Maintenance (ICSM ’00), pp. 216–226, 2000.Google Scholar
  3. 3.
    Chris Fox, Sebastian Danicic, Mark Harman and Robert M. Hierons. ConSIT: A Fully Automated Conditioned Program Slicer. Software-Practice and Experience-SPE, Vol. 34, No. 1, pp. 15–46, 2004.Google Scholar
  4. 4.
    Susan Horwitz, Thomas Reps and David Binkley. Interprocedural Slicing using Dependence Graphs. ACM Transactions on Programming Languages and Systems, Vol. 12, No. 1, pp. 26–60, January 1990.Google Scholar
  5. 5.
    Rob Hierons, Mark Harman, Chris Fox, Mohammed Daoudi and Lahcen Ouarbya. Conditioned Slicing Supports Partition Testing, Software Testing, Verification and Reliability, Vol. 12, No. 1, pp. 23–28, 2002.Google Scholar
  6. 6.
    Sebastian Danicic, Andrea De Lucia and Mark Harman. Building Executable Union Slices using Conditioned Slicing. In proceedings of 12th IEEE International Workshop on Program Comprehension, pp. 89–97, 24–26 June 2004.Google Scholar
  7. 7.
    Diego Cheda and Salvador Cavadini. Conditioned Slicing for First Order Functional Logic Programs. In proceedings of 17th International Workshop on Functional and (Constraint) Logic Programming (WFLP ’08), pp. 1–14, Elsevier Science, Vol. 34, July 2008.Google Scholar
  8. 8.
    Josep Silva. A Vocabulary of Program Slicing Based Techniques. ACM Computing Surveys (CSUR), Vol. 44, No. 3, June 2012.Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2017

Authors and Affiliations

  1. 1.Department of CSENational Institute of TechnologyRourkelaIndia

Personalised recommendations