Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent

Reuben Rowe, James Brotherston

Research output: Chapter in Book/Report/Conference proceedingConference contribution

42 Downloads (Pure)


In program verification, measures for proving the termination of programs are typically constructed using (notions of size for) the data manipulated by the program. Such data are often described by means of logical formulas. For example, the cyclic proof technique makes use of semantic approximations of inductively defined predicates to construct Fermat-style infinite descent arguments. However, logical formulas must often incorporate explicit size information (e.g. a list length parameter) in order to support inter-procedural analysis.

In this paper, we show that information relating the sizes of inductively defined data can be automatically extracted from cyclic proofs of logical entailments. We characterise this information in terms of a graph-theoretic condition on proofs, and show that this condition can be encoded as a containment between weighted automata. We also show that under certain conditions this containment falls within known decidability results. Our results can be viewed as a form of realizability for cyclic proof theory.
Original languageEnglish
Title of host publicationTABLEAUX 2017
Subtitle of host publicationAutomated Reasoning with Analytic Tableaux and Related Methods
Number of pages16
ISBN (Electronic)978-3-319-66902-1
ISBN (Print)978-3-319-66901-4
Publication statusE-pub ahead of print - 30 Aug 2017

Publication series

NameLecture Notes in Computer Science

Cite this