Certifying a Termination Criterion Based on Graphs, without Graphs


Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. This is a problem when it comes to issues such as the certification of a proof of well-foundedness, since premises of generic theorems involving graph properties may be at least as… (More)
DOI: 10.1007/978-3-540-71067-7_17


2 Figures and Tables

Slides referencing similar topics