• DocumentCode
    2704421
  • Title

    An ant colony optimization technique for abstraction-guided state justification

  • Author

    Li, Min ; Hsiao, Michael S.

  • Author_Institution
    Bradley Dept. of Electr. & Comput. Eng., Virginia Tech, Blacksburg, VA, USA
  • fYear
    2009
  • fDate
    1-6 Nov. 2009
  • Firstpage
    1
  • Lastpage
    10
  • Abstract
    In this paper, a novel heuristic for abstraction-guided state justification is proposed based on ant colony optimization (ACO). A probabilistic state transition model is developed to help formulate the state justification problem as a searching scheme of artificial ants. The amount of pheromone left by the ants is directly proportional to the quality of the search so that it can serve as an effective guidance for the search. In addition, the intelligence based on the collective behavior is capable of avoiding critical dead-end states as well as fast convergence to the target state. Experimental results demonstrated that our approach is superior in reaching hard-to-reach states in sequential circuit compared to other methods.
  • Keywords
    automatic test pattern generation; optimisation; abstraction-guided state justification; ant colony optimization; hard-to-reach states; probabilistic state transition model; sequential circuit; Ant colony optimization; Automatic test pattern generation; Circuit testing; Computational modeling; Computer simulation; Costs; Engines; Evolutionary computation; Genetic algorithms; Optimization methods;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Test Conference, 2009. ITC 2009. International
  • Conference_Location
    Austin, TX
  • Print_ISBN
    978-1-4244-4868-5
  • Electronic_ISBN
    978-1-4244-4867-8
  • Type

    conf

  • DOI
    10.1109/TEST.2009.5355676
  • Filename
    5355676