Towards a theory of reach

Fowler, Jonathan; Hutton, Graham

Abstract

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.

Citation

Fowler, J., & Hutton, G. (2016). Towards a theory of reach. Lecture Notes in Artificial Intelligence, 9547, https://doi.org/10.1007/978-3-319-39110-6

• Journal Article Type: Article
• Acceptance Date: Sep 11, 2015
• Publication Date: May 12, 2016
• Deposit Date: Apr 8, 2016
• Publicly Available Date: May 12, 2016
• Journal: Lecture Notes in Computer Science
• Electronic ISSN: 0302-9743
• Publisher: Springer Verlag
• Peer Reviewed: Peer Reviewed
• Volume: 9547
• DOI: https://doi.org/10.1007/978-3-319-39110-6
• Public URL: https://nottingham-repository.worktribe.com/output/790242
• Publisher URL: http://www.springer.com/gb/book/9783319391090
• Additional Information: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-39110-6. Chapter in: Trends in Functional Programming : 16th International Symposium, TFP 2015, Sophia Antipolis, France, June 3-5, 2015. Revised Selected Papers. E-ISBN 9783319391106
• Contract Date: Apr 8, 2016