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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
