Abstract
This paper describes the theory and implementation of a testability measure program called RFOTM. It is suggested that the real difficulty in test generation should be reflected in testability measure. We analyse the behavior of fanout and reconvergent fanout which cause inconsistency in generating tests. A classification of fanouts is given and a class of fanouts which behaves like fanout-free lines is described. Based on this observation, the new measure is developed with emphasis on the influence of fanout and reconvergent fanout, and is shown with more accurate prediction for testing difficulty and acceptable computing complexity.
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.
