Chen, H.-Y. and Cook, B. and Fuhs, Carsten and Nimkar, K. and O’Hearn, P. (2014) Proving Nontermination via safety. In: Abraham, E. and Havelund, K. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes In Computer Science 8413. New York, U.S.: Springer, pp. 156-171. ISBN 9783642548611.
|
Text
TACAS14-nontermination.pdf - Author's Accepted Manuscript Download (411kB) | Preview |
Abstract
We show how the problem of nontermination proving can be reduced to a question of underapproximation search guided by a safety prover. This reduction leads to new nontermination proving implementation strategies based on existing tools for safety proving. Our preliminary implementation beats existing tools. Furthermore, our approach leads to easy support for programs with unbounded nondeterminism.
Metadata
| Item Type: | Book Section |
|---|---|
| Keyword(s) / Subject(s): | Proceedings, 20th International Conference, TACAS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-54862-8_11 |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Carsten Fuhs |
| Date Deposited: | 10 Dec 2015 13:09 |
| Last Modified: | 30 Jul 2025 09:28 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/13545 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
