Skip to main content

Automatic cyclic termination proofs for recursive procedures in separation logic

Rowe, Reuben, Brotherston, James (2017) Automatic cyclic termination proofs for recursive procedures in separation logic. In: Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs. . pp. 53-65. ACM ISBN 978-1-4503-4705-1. (doi:10.1145/3018610.3018623)

PDF - Author's Accepted Manuscript

Creative Commons Licence
This work is licensed under a Creative Commons Attribution 4.0 International License.
Download (301kB) Preview
Official URL


We describe a formal verification framework and tool implementation, based upon cyclic proofs, for certifying the safe termination of imperative pointer programs with recursive procedures. Our assertions are symbolic heaps in separation logic with user defined inductive predicates; we employ explicit approximations of these predicates as our termination measures. This enables us to extend cyclic proof to programs with procedures by relating these measures across the pre- and postconditions of procedure calls. We provide an implementation of our formal proof system in the Cyclist theorem proving framework, and evaluate its performance on a range of examples drawn from the literature on program termination. Our implementation extends the current state-of-the-art in cyclic proof-based program verification, enabling automatic termination proofs of a larger set of programs than previously possible.

Item Type: Conference or workshop item (Proceeding)
DOI/Identification number: 10.1145/3018610.3018623
Divisions: Faculties > Sciences > School of Computing
Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Reuben Rowe
Date Deposited: 24 Nov 2017 13:30 UTC
Last Modified: 29 May 2019 19:54 UTC
Resource URI: (The current URI for this page, for reference purposes)
Rowe, Reuben:
  • Depositors only (login required):


Downloads per month over past year