Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Automated verification of termination certificates (1212.2350v1)

Published 11 Dec 2012 in cs.LO, cs.MS, and cs.SE

Abstract: In order to increase user confidence, many automated theorem provers provide certificates that can be independently verified. In this paper, we report on our progress in developing a standalone tool for checking the correctness of certificates for the termination of term rewrite systems, and formally proving its correctness in the proof assistant Coq. To this end, we use the extraction mechanism of Coq and the library on rewriting theory and termination called CoLoR.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Frédéric Blanqui (40 papers)
  2. Kim Quyen Ly (1 paper)
Citations (4)

Summary

We haven't generated a summary for this paper yet.