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/ |
| _version_ | 1848794470341935104 |
|---|---|
| author | Fowler, Jonathan Hutton, Graham |
| author_facet | Fowler, Jonathan Hutton, Graham |
| author_sort | Fowler, Jonathan |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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 previous work, Naylor and Runciman have developed a reachability solver for Haskell, based on the use of lazy narrowing from functional logic programming. Their work was focused on practical issues concerning implementation and performance. In this paper, we lay the groundwork for an underlying theory of such a system, by formally establishing the correctness of a simple reach solver. |
| first_indexed | 2025-11-14T19:16:42Z |
| format | Article |
| id | nottingham-32700 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T19:16:42Z |
| publishDate | 2016 |
| publisher | Springer Verlag |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-327002020-05-04T17:52:06Z https://eprints.nottingham.ac.uk/32700/ Towards a theory of reach Fowler, Jonathan Hutton, Graham 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 previous work, Naylor and Runciman have developed a reachability solver for Haskell, based on the use of lazy narrowing from functional logic programming. Their work was focused on practical issues concerning implementation and performance. In this paper, we lay the groundwork for an underlying theory of such a system, by formally establishing the correctness of a simple reach solver. Springer Verlag 2016-05-12 Article PeerReviewed Fowler, Jonathan and Hutton, Graham (2016) Towards a theory of reach. Lecture Notes in Computer Science, 9547 . pp. 22-39. ISSN 0302-9743 http://www.springer.com/gb/book/9783319391090 doi:10.1007/978-3-319-39110-6 doi:10.1007/978-3-319-39110-6 |
| spellingShingle | Fowler, Jonathan Hutton, Graham Towards a theory of reach |
| title | Towards a theory of reach |
| title_full | Towards a theory of reach |
| title_fullStr | Towards a theory of reach |
| title_full_unstemmed | Towards a theory of reach |
| title_short | Towards a theory of reach |
| title_sort | towards a theory of reach |
| url | https://eprints.nottingham.ac.uk/32700/ https://eprints.nottingham.ac.uk/32700/ https://eprints.nottingham.ac.uk/32700/ |