Compactness Lemma for Recursive Functions: A Formal Verification Approach
The compactness lemma states that any recursive function can be simulated by a finite unrolling of the function. This paper presents a new proof technique for formally verifying the compactness lemma using a pattern stepping bisimulation approach.
