Towards a theory of reach

Tools

Fowler, Jonathan and Hutton, Graham (2016) Towards a theory of reach. Lecture Notes in Computer Science, 9547 . pp. 22-39. ISSN 0302-9743

Full text not available from this repository.

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.

Item Type: Article
RIS ID: https://nottingham-repository.worktribe.com/output/790242
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
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number: https://doi.org/10.1007/978-3-319-39110-6
Depositing User: Hutton, Prof Graham
Date Deposited: 08 Apr 2016 10:21
Last Modified: 04 May 2020 17:52
URI: https://eprints.nottingham.ac.uk/id/eprint/32700

Actions (Archive Staff Only)

Edit View Edit View