A method of search space pruning based on search state dominance

✍ Scribed by Takayuki Fujino; Hideo Fujiwara

• Book ID: 104591625
• Publisher: John Wiley and Sons
• Year: 1994
• Tongue: English
• Weight: 856 KB
• Volume: 25
• Category: Article
• ISSN: 0882-1666
• DOI: 10.1002/scj.4690250401

✦ Synopsis

Abstract

EST (Equivalent STate hashing) algorithm, which reduces the search space form a different point of view from the conventional methods, was proposed for test generation by Giraldi and Bushnell. In this method the processes and results of the test pattern searches are stored and used to avoid fruitless searches to reduce the search space. In this paper the concept of search state equivalence, which is introduced for EST, is extended to that of search state dominance. Based on that concept an algorithm DST (Dominant STate hashing) is proposed. The search state dominance can prune the search space more effectively than the search state equivalence.