Skip to main content
SpringerLink
Log in

Assertion-based slicing and slice graphs

  • Original Article
  • Published:
Formal Aspects of Computing

Abstract

This paper revisits the idea of slicing programs based on their axiomatic semantics, rather than using criteria based on control/data dependencies. We show how the forward propagation of preconditions and the backward propagation of postconditions can be combined in a new slicing algorithm that is more precise than the existing specification-based algorithms. The algorithm is based on (a) a precise test for removable statements, and (b) the construction of a slice graph, a program control flow graph extended with semantic labels and additional edges that “short-circuit” removable commands. It improves on previous approaches in two aspects: it does not fail to identify removable commands; and it produces the smallest possible slice that can be obtained (in a sense that will be made precise). Iteration is handled through the use of loop invariants and variants to ensure termination. The paper also discusses in detail applications of these forms of slicing, including the elimination of (conditionally) unreachable and dead code, and compares them to other related notions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahrendt W, Baar T, Beckert B, Bubel R, Giese M, Hähnle R, Menzel W, Mostowski W, Roth A, Schlager S, Schmitt PH (2005) The KeY tool. Softw System Model, 4(1): 32–54

    Article  Google Scholar 

  2. Burdy L, Cheon Y, Cok DR, Ernst MD, Kiniry JR, Leavens GT, Rustan K, Leino M, Poll E (2005) An overview of JML tools and applications. Int J Softw Tools Technol Transf 7(3): 212–232

    Article  Google Scholar 

  3. Barnett M, Evan Chang B-Y, DeLine R, Jacobs B, Rustan K, Leino M (2005) Boogie: a modular reusable verifier for object-oriented programs. In: de Boer FS, Bonsangue MM, Graf S, de Roever WP (eds) FMCO, Lecture Notes in Computer Science, vol 4111. Springer, Berlin, pp 364–387

    Google Scholar 

  4. Baudin P, Cuoq P, Filliâtre J-C, Marché C, Monate B, Moy Y, Prevosto V (2010) ACSL: ANSI/ISO C Specification Language. CEA LIST and INRIA

  5. Barros J, da Cruz D, Henriques PR, Pinto JS (2010) Assertion-based slicing and slice graphs. In: Fiadeiro JL, Gnesi S (eds) Proceedings of the 8th IEEE international conference on software engineering and formal methods (SEFM’10). IEEE Computer Society, pp 93–102

  6. Barnett M, Rustan K, Leino M, Schulte W (2004) The Spec# programming system: an overview. In: CASSIS: construction and analysis of safe, secure, and interoperable smart devices, Lecture Notes in Computer Science, vol 3362. Springer, Berlin, pp 49–69

  7. Canfora G, Cimitile A, De Lucia A (1998) Conditioned program slicing. Inform Softw Technol 40(11–12): 595–608 (Special issue on program slicing)

    Article  Google Scholar 

  8. Comuzzi JJ, Hart JM (1996) Program slicing using weakest preconditions. In: FME ’96: Proceedings of the third international symposium of formal methods Europe on industrial benefit and advances in formal methods. Springer, London, pp 557–575

  9. Chung IS, Lee WK, Yoon GS, Kwon YR (2001) Program slicing based on specification. In: SAC ’01: Proceedings of the 2001 ACM symposium on applied computing. ACM New York, pp 605–609

  10. da Cruz D, Henriques PR, Pinto JS (2011) Verification graphs for programs with contracts (Submitted for publication)

  11. da Cruz D, Henriques PR, Pinto JS (2010) Gamaslicer: an online laboratory for program verification and analysis. In: LDTA ’10: Proceedings of the tenth workshop on language descriptions, tools and applications. ACM, New York, pp 1–8

  12. Dijkstra EW (1976) A discipline of programming. Prentice-Hall, Englewood Cliffs

  13. Fox C, Danicic S, Harman M, Hierons RM (2001) Backward conditioning: a new program specialisation technique and its application to program comprehension. In: Proceedings of the 9th international workshop on program comprehension (IWPC’01). IEEE Computer Society, pp 89–97

  14. Frade MJ, Pinto JS (2011) Verification Conditions for source-level imperative programs. Comput Sci Rev 5: 252–277

    Article  Google Scholar 

  15. Flanagan C, Saxe JB (2001) Avoiding exponential explosion: generating compact verification conditions. In: POPL ’01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on principles of programming languages. ACM, New York, pp 193–205

  16. Harman M, Hierons RM, Fox C, Danicic S, Howroyd J (2001) Pre/post conditioned slicing. In: Proceedings of the IEEE international conference on software maintenance (ICSM’01). IEEE Computer Society, pp 138–147

  17. Hoare CAR (1969) An axiomatic basis for computer programming. Commun ACM, 12: 576–580

    Article  MATH  Google Scholar 

  18. Meyer B (1992) Applying “Design by contract”. IEEE Comput, 25(10)

  19. Ward M (2009) Properties of slicing definitions. In: SCAM ’09: Proceedings of the 2009 ninth IEEE international working conference on source code analysis and manipulation. IEEE Computer Society, Washington, pp 23–32

  20. Weiser M (1981) Program slicing. In: ICSE ’81: Proceedings of the 5th international conference on software engineering. IEEE Press, Piscataway, pp 439–449

  21. Xu B, Qian J, Zhang X, Wu Z, Chen L (2005) A brief survey of program slicing. SIGSOFT Softw. Eng. Notes 30(2): 1–36

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Informática/CCTC, Universidade do Minho, Campus de Gualtar, 4710-057, Braga, Portugal

    José Bernardo Barros, Daniela da Cruz, Pedro Rangel Henriques & Jorge Sousa Pinto

Authors
  1. José Bernardo Barros
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniela da Cruz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pedro Rangel Henriques
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jorge Sousa Pinto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jorge Sousa Pinto.

Additional information

José Fiadero, Stefania Gnesi and Tom Maibaum

Rights and permissions

Reprints and permissions

About this article

Cite this article

Barros, J.B., da Cruz, D., Henriques, P.R. et al. Assertion-based slicing and slice graphs. Form Asp Comp 24, 217–248 (2012). https://doi.org/10.1007/s00165-011-0196-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00165-011-0196-1

Keywords

Search

Navigation