Section: New Results
A Proof theory of induction and co-induction
Systems like the model-checker Bedwyr provides properties of computational system by exploring all of its finite behaviors. As a result, most such systems cannot handle infinite state spaces and, hence, cannot handle the vast majority of computer systems. Baelde and Miller [Oops!] [Oops!] have been exploring a proof theory for induction and coinduction within linear logic: given the cut-elimination and focusing results that they have obtained, it should be possible to developing some effective tools to help automate proofs that require induction and coinduction: at least when the required invariants are easy to guess.