A new algorithm for slicing unstructured programs.
Mark HarmanSebastian DanicicPublished in: J. Softw. Maintenance Res. Pract. (1998)
Keyphrases
- high accuracy
- cost function
- dynamic programming
- k means
- detection algorithm
- improved algorithm
- optimization algorithm
- np hard
- times faster
- recognition algorithm
- experimental evaluation
- learning algorithm
- preprocessing
- computational cost
- clustering method
- matching algorithm
- segmentation algorithm
- path planning
- theoretical analysis
- significant improvement
- computational complexity
- search algorithm
- similarity measure
- selection algorithm
- single pass
- tree structure
- experimental study
- expectation maximization
- particle swarm optimization
- simulated annealing
- worst case
- search space