Integration of slicing methods into a Cultural Algorithm in order to assist in large-scale engineering systems design
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.
Unable to display preview. Download preview PDF.
- 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–139Google Scholar
- 4.Mark Weiser, 1984, Program Slicing, IEEE Transactions on Software Engineering. VOLSE-10, No 4Google Scholar
- 5.Bogdan Korel, Janusz Lasky, 1988, “Automatic Program Bug Location By Program Slicing”, Information Processing Letters 29 155–163 North-Holland PressGoogle Scholar
- 6.Elena Zannoni, Robert G. Reynolds, 1997, “Learning to Control the Program Evolution Process with Cultural Algorithms”, Evolutionary Computation, 5(2) 181–211Google 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:195Google Scholar