Applications of feasible path analysis to program testing

Allen Goldberg, T. C. Wang, David Zimmerman
1994 Proceedings of the 1994 international symposium on Software testing and analysis - ISSTA '94  
For certain structural testing criteria a significant proportion of tests instances are infeasible in the sense the semantics of the program implies that test data cannot be constructed that meet the test requirement. This paper describes the design and prototype implementation of a structural testing system that uses a theorem prover to determine feasibility of testing requirements and to optimize * Work performed by the author while affiliated with Kestrel
doi:10.1145/186258.186523 dblp:conf/issta/GoldbergWZ94 fatcat:q5sa4lqjbbfyrhaq6vwvflcsxm