Skip to main content

Integration of slicing methods into a Cultural Algorithm in order to assist in large-scale engineering systems design

  • Conference paper
  • First Online:
Evolutionary Programming VII (EP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1447))

Included in the following conference series:

Abstract

Programmers often employ knowledge-based heuristic approaches in the application of solving programming problems. Program slicing is one tool used to acquire such knowledge within the area of Software Engineering to support the debugging, testing, maintenance and understanding of programs. Program slicing is the determination of the set of all the statements in a program that directly or indirectly affects the value of a variable occurrence. Genetic Programming is the process of using evolutionary techniques to identify information that can be used to identify the location of problems in program code. We believe that within a Cultural Algorithm framework, a testing analysis agent can be implemented utilizing slicing techniques in order to produce more accurate program metrics.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Roger S. Pressman, 1997, “Software Engineering: A Practitioners Approach”, McGraw Hill 1997.

    Google Scholar 

  2. Koza, John R., 1992, “Genetic Programming: On the Programming of Computers By Means of Natural Selection”, The MIT Press, Cambridge, Massachusetts.

    Google Scholar 

  3. Robert G. Reynolds, 1994, “An Introduction to Cultural Algorithms”, In Proceedings of the 3rd Annual Conference on Evolutionary Programming, Sebalk, A.V. Fogel L.J.(editors), River Edge, NJ. World Scientific Publishing, 1994, pp. 131–139

    Google Scholar 

  4. Mark Weiser, 1984, Program Slicing, IEEE Transactions on Software Engineering. VOLSE-10, No 4

    Google Scholar 

  5. Bogdan Korel, Janusz Lasky, 1988, “Automatic Program Bug Location By Program Slicing”, Information Processing Letters 29 155–163 North-Holland Press

    Google Scholar 

  6. Elena Zannoni, Robert G. Reynolds, 1997, “Learning to Control the Program Evolution Process with Cultural Algorithms”, Evolutionary Computation, 5(2) 181–211

    Google Scholar 

  7. Hiralal Agrawal, Joseph R. Horgan, 1990, Dynamic Program Slicing, Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation, White Plains, New York, pp 246–252.

    Google Scholar 

  8. Bogdan Korel, Janusz Lasky, 1990, “Dynamic Slicing of Computer Programs”, J. System Software 1990, 13:187:195

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

V. W. Porto N. Saravanan D. Waagen A. E. Eiben

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ostrowski, D.A., Reynolds, R.G. (1998). Integration of slicing methods into a Cultural Algorithm in order to assist in large-scale engineering systems design. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds) Evolutionary Programming VII. EP 1998. Lecture Notes in Computer Science, vol 1447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0040772

Download citation

  • DOI: https://doi.org/10.1007/BFb0040772

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64891-8

  • Online ISBN: 978-3-540-68515-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics