Towards a theory of reach
When testing a program, there are usually some parts that are rarely executed and hence more difficult to test. Finding inputs that guarantee that such parts are executed is an example of a reach problem, which in general seeks to ensure that targeted parts of a program are always executed. In previ...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
Springer Verlag
2016
|
| Online Access: | https://eprints.nottingham.ac.uk/32700/ |