brief-report

Open access

Slicing programs in the presence of errors

Authors:

Sebastian DanicicAuthors Info & Claims

Formal Aspects of Computing, Volume 8, Issue 4

Pages 490 - 497

https://doi.org/10.1007/BF01213536

Published: 01 July 1996 Publication History

Abstract

Program slicing is a technique by which statements are deleted from a program in such a way as to preserve a projection of the original program's semantics. It is shown that slicing algorithms based upon traditional defined and referenced variable sets do not preserve a projection of strict semantics with respect to computations which cause errors. Rather, these approaches preserve a projection of the program's semantics which is lazy with respect to errors. A modified version of defined and referenced variable sets is introduced, which provides the freedom to choose the form of semantics to be preserved.

References

References

[1]

Aho, A. V., Sethi, R. and Ullman, J. D.:Compilers: Principles, techniques and tools. Addison Wesley, 1986.

[2]

Bieman J. M. and Ott L. M. Measuring functional cohesion IEEE Transactions on Software Engineering 1994 20 8 644-657

Digital Library

[3]

Cartwright, R. and Felleisen, M.: The semantics of program dependence. InACM SIGPLAN Conference on Programming Language Design and Implementation, pages 13–27, 1989.

[4]

Ferrante J., Ottenstein K. J., and Warren J. D. The program dependence graph and its uses in optimization ACM Transactions on Programming Languages and Systems 1987 9 319-349

Digital Library

[5]

Gallagher K. B. and Lyle J. R. Using program slicing in software maintenance IEEE Transactions on Software Engineering 1991 17 8 751-761

Digital Library

[6]

Harman, M. and Danicic, S.: Using program slicing to simplify testing.Journal of Software Testing, Verification and Reliability, 1995. To appear.

[7]

Harman, M., Danicic, S., Sivagurunathan, B., Jones, B. and Sivagurunathan, Y.: Cohesion metrics. In 8^thInternational Quality Week, pages Paper 3-T-2, pp 1–14, San Francisco, May 29th – June 2nd. 1995.

[8]

Horwitz S., Prins J., and Reps T. Integrating non-interfering versions of programs ACM Transactions on Programming Languages and Systems 1989 11 3 345-387

Digital Library

[9]

Kamkar M. Interprocedural dynamic slicing with applications to debugging and testing PhD Thesis 1993 Sweden Department of Computer Science and Information Science, Linköping University

[10]

Korel B. and Laski J. Dynamic program slicing Information Processing Letters 1988 29 3 155-163

Digital Library

[11]

Lakhotia, A.: Rule-based approach to computing module cohesion. InProceedings of the 15^thConference on Software Engineering (ICSE-15), pages 34–44, 1993.

[12]

Liu L. and Ellis R. An approach to eliminating COMMON blocks and deriving ADTs from Fortran programs Technical report 1993 UK University of Westminster

[13]

Lyle, J. R. and Weiser, M.: Automatic program bug location by program slicing. In 2ndInternational Conference on Computers and Applications, pages 877–882, Peking, 1987.

[14]

Simpson D., Valentine S. H., Mitchell R., Liu L., and Ellis R. Recoup — Maintaining Fortran ACM SIGPlan Fortran forum 1993 12 3 26-32

Digital Library

[15]

Tip F. Generation of Program Analysis Tools PhD thesis 1995 Amsterdam Centrum voor Wiskunde en Informatica

[16]

Tip F. and Venkatesh G. A. A survey of program slicing techniques Proceedings inSIGPLAN Notices 1995 26 6 26-28 [Ven91]

[17]

Weiser M. Program slices: Formal, psychological, and practical investigations of an automatic program abstraction method PhD thesis 1979 MI University of Michigan, Ann Arbor

[18]

Weiser M. Program slicing IEEE Transactions on Software Engineering 1984 10 4 352-357

Digital Library

Cited By

Léchenet JKosmatov NLe Gall P(2018)Cut branches before looking for bugs: certifiably sound verification on relaxed slicesFormal Aspects of Computing10.1007/s00165-017-0439-x30:1(107-131)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1007/s00165-017-0439-x
Léchenet JKosmatov NGall P(2016)Cut Branches Before Looking for BugsProceedings of the 19th International Conference on Fundamental Approaches to Software Engineering - Volume 963310.1007/978-3-662-49665-7_11(179-196)Online publication date: 2-Apr-2016
https://dl.acm.org/doi/10.1007/978-3-662-49665-7_11
Binkley DDanicic SGyimóthy THarman MKiss ÁKorel B(2006)Theoretical foundations of dynamic program slicingTheoretical Computer Science10.1016/j.tcs.2006.01.012360:1(23-41)Online publication date: 21-Aug-2006
https://dl.acm.org/doi/10.1016/j.tcs.2006.01.012
Show More Cited By

Index Terms

Slicing programs in the presence of errors
1. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
      1. Software defect analysis
        Software testing and debugging
  2. Software notations and tools
2. Theory of computation
  1. Semantics and reasoning
    1. Program reasoning
    2. Program semantics

Index terms have been assigned to the content through auto-classification.

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 ...
Abstract program slicing: from theory towards an implementation
ICFEM'10: Proceedings of the 12th international conference on Formal engineering methods and software engineering

In 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 ...
Non-Standard Semantics for Program Slicing

In this paper we generalize the notion of compositional semantics to cope with transfinite reductions of a transition system. Standard denotational and predicate transformer semantics, even though compositional, provide inadequate models for some known ...

Comments

Information & Contributors

Information

Published In

cover image Formal Aspects of Computing

Formal Aspects of Computing Volume 8, Issue 4

Jul 1996

120 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

© BCS 1996.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 July 1996

Accepted: 15 November 1995

Received: 15 December 1994

Published in FAC Volume 8, Issue 4

Author Tags

Qualifiers

Brief-report

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
34
Total Downloads

Downloads (Last 12 months)22
Downloads (Last 6 weeks)4

Reflects downloads up to 09 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Léchenet JKosmatov NLe Gall P(2018)Cut branches before looking for bugs: certifiably sound verification on relaxed slicesFormal Aspects of Computing10.1007/s00165-017-0439-x30:1(107-131)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1007/s00165-017-0439-x
Léchenet JKosmatov NGall P(2016)Cut Branches Before Looking for BugsProceedings of the 19th International Conference on Fundamental Approaches to Software Engineering - Volume 963310.1007/978-3-662-49665-7_11(179-196)Online publication date: 2-Apr-2016
https://dl.acm.org/doi/10.1007/978-3-662-49665-7_11
Binkley DDanicic SGyimóthy THarman MKiss ÁKorel B(2006)Theoretical foundations of dynamic program slicingTheoretical Computer Science10.1016/j.tcs.2006.01.012360:1(23-41)Online publication date: 21-Aug-2006
https://dl.acm.org/doi/10.1016/j.tcs.2006.01.012
Binkley DDanicic SGyimóthy THarman MKiss ÁKorel B(2006)A formalisation of the relationship between forms of program slicingScience of Computer Programming10.1016/j.scico.2006.04.00762:3(228-252)Online publication date: 15-Oct-2006
https://dl.acm.org/doi/10.1016/j.scico.2006.04.007
Binkley DDanicic SGyimothy THarman MKiss AKorel B(2005)Minimal Slicing and the Relationships Between Forms of SlicingProceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation10.1109/SCAM.2005.18(45-56)Online publication date: 30-Sep-2005
https://dl.acm.org/doi/10.1109/SCAM.2005.18
Danicic SFox CHarman MHierons RHowroyd JLaurence M(2005)Static Program Slicing Algorithms are Minimal for Free Liberal Program SchemasThe Computer Journal10.1093/comjnl/bxh12148:6(737-748)Online publication date: 1-Nov-2005
https://dl.acm.org/doi/10.1093/comjnl/bxh121
Laurence MDanicic SHarman MHierons RHowroyd J(2003)Equivalence of conservative, free, linear program schemas is decidableTheoretical Computer Science10.1016/S0304-3975(02)00374-2290:1(831-862)Online publication date: 1-Jan-2003
https://dl.acm.org/doi/10.1016/S0304-3975%2802%2900374-2
Wotawa F(2002)On the relationship between model-based debugging and program slicingArtificial Intelligence10.1016/S0004-3702(01)00161-8135:1-2(125-143)Online publication date: 1-Feb-2002
https://dl.acm.org/doi/10.1016/S0004-3702%2801%2900161-8
Harman MHierons R(2002)An overview of program slicingSoftware Focus10.1002/swf.412:3(85-92)Online publication date: 25-Jan-2002
https://doi.org/10.1002/swf.41
Harman MHierons RDanicic SHowroyd JLaurence MFox C(2001)Node coarsening calculi for program slicingProceedings Eighth Working Conference on Reverse Engineering10.1109/WCRE.2001.957807(25-34)Online publication date: 2001
https://doi.org/10.1109/WCRE.2001.957807

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents