Verification of Attributes in Linked Lists Using Ant Colony Metaphor

The chapter describes the validation of the attributes of linked list using modified pheromone biased model (of Ant colony) under complex application environment mainly for kernel configuration and device driver operations. The proposed approach incorporates the idea of pheromone exploration strategy with small learning parameter associated while traversing a linked list. This process of local propagation on loop and learning on traversal is not available with the conventional validation mechanism of data structure using predicate logic. It has also been observed from simulation that the proposed ant colony algorithm with different pheromone value produces better convergence on linked list.