Abstract
This paper extends the theory of constraint solving and presents a method to solve logical expression constraint problems existing in the process of generating test cases automatically. It defines the concept of the logical expression constraint on the path of C programs. In order to improve solving efficiency, it also presents an algorithm of pre-processing and heuristic backtracking. Our experiment results show that the method can narrow the domain of variables from meaningless infinite intervals to a finite range and achieve better coverage, and the results also show that the algorithm can improve the testing efficiency and halve the time of generating test cases.
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 callMore From: IOP Conference Series: Materials Science and Engineering
Disclaimer: 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.
