O'Hearn, PW;
(2018)
Continuous Reasoning: Scaling the impact of formal methods.
In:
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science.
(pp. pp. 13-25).
ACM: New York (NY), USA.
Preview |
Text
O'Hearn_Continuous reasoning. Scaling the impact of formal methods_VoR.pdf - Published Version Download (635kB) | Preview |
Abstract
This paper describes work in continuous reasoning, where formal reasoning about a (changing) codebase is done in a fashion which mirrors the iterative, continuous model of software development that is increasingly practiced in industry. We suggest that advances in continuous reasoning will allow formal reasoning to scale to more programs, and more programmers. The paper describes the rationale for continuous reasoning, outlines some success cases from within industry, and proposes directions for work by the scientific community.
| Type: | Proceedings paper |
|---|---|
| Title: | Continuous Reasoning: Scaling the impact of formal methods |
| Event: | The 33rd Annual ACM/IEEE Symposium on Logic in Computer Science |
| Location: | New York (NY), USA |
| Dates: | 9th-12th July 2018 |
| ISBN-13: | 978-1-4503-5583-4 |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1145/3209108.3209109 |
| Publisher version: | https://dx.doi.org/10.1145/3209108.3209109 |
| Language: | English |
| Additional information: | © 2018 Copyright held by the owner/author(s). This work is licensed under a Creative Commons Attribution International 4.0 License (https://creativecommons.org/licenses/by/4.0/). |
| Keywords: | Reasoning, Continuous Integration |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10074600 |
Loading...
Loading...Loading...Loading...Archive Staff Only
 |
View Item |
