BIROn - Birkbeck Institutional Research Online

Disproving termination with overapproximation

Cook, B. and Fuhs, Carsten and Nimkar, K. and O'Hearn, P. (2014) Disproving termination with overapproximation. In: UNSPECIFIED (ed.) Formal Methods in Computer-Aided Design (FMCAD 2014). IEEE Computer Society, pp. 67-74. ISBN 9780983567844.

[img]
Preview
Text
FMCAD14-live-abstractions.pdf - Author's Accepted Manuscript

Download (224kB) | Preview

Abstract

When disproving termination using known techniques (e.g. recurrence sets), abstractions that overapproximate the program’s transition relation are unsound. In this paper we introduce live abstractions, a natural class of abstractions that can be combined with the recent concept of closed recurrence sets to soundly disprove termination. To demonstrate the practical usefulness of this new approach we show how programs with nonlinear, nondeterministic, and heap-based commands can be shown nonterminating using linear overapproximations.

Metadata

Item Type: Book Section
Additional Information: Copyright IEEE 2014
School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User: Carsten Fuhs
Date Deposited: 10 Dec 2015 13:04
Last Modified: 08 Aug 2025 23:12
URI: https://eprints.bbk.ac.uk/id/eprint/13533

Statistics

6 month trend
368Downloads
6 month trend
262Hits

Additional statistics are available via IRStats2.

Archive Staff Only (login required)

Edit/View Item
Edit/View Item