Experiments determining best paths for testing computer program predicates
ICSE '85 Proceedings of the 8th international conference on Software engineering
The causes and effects of infeasible paths in computer programs
ICSE '85 Proceedings of the 8th international conference on Software engineering
Inductive methods for proving properties of programs
Communications of the ACM
Path feasibility, linear optimizers and the evaluate standard form
ACM SIGPLAN Notices
| Hi-index | 0.00 |
Paths are often used as a basis for the testing of programs. The identification of feasible and infeasible paths is central to a path-based approach to testing. Linear optimizers have been used for determining path feasibility by using the path predicates as constraints of an optimization problem. Commercial programs have been identified as amenable to the linear optimizer approach but the occurrence of alphanumeric literals poses a problem as they cannot be submitted to a numerical optimizer. It is suggested that this problem can be surmounted easily. Two approaches are briefly described. The first substitutes numeric tokens for alphanumeric literals. The second segregates the alphanumeric predicates from the numeric predicates and deals with them independently. The first approach appears to be a practical solution while the second appears to be less useful.