Analysis of the constraint solver in UNA based test data generation.
In a series of articles Gupta et al. develop a framework for automatic test data generation for computer programs. In general, their approach consists of a branch predicate collector, which derives a system of linear inequalities representing the branch predicates for a given path in the program. Th...
| Argitaratua izan da: | Software engineering notes. 26, 5 (2001). |
|---|---|
| Egile nagusia: | |
| Formatua: | Artikulua |
| Hizkuntza: | English |
| Gaiak: |