@article{blanqui_automated_2012,
	title = {Automated verification of termination certificates},
	url = {https://core.ac.uk/display/24786286?recSetID=},
	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},
	language = {en-gb},
	urldate = {2021-01-29},
	author = {Blanqui, Frédéric and Ly, Kim Quyen},
	year = {2012},
	keywords = {⛔ No DOI found},
}

{"_id":"jQeKPMFKx9dr9BWrY","bibbaseid":"blanqui-ly-automatedverificationofterminationcertificates-2012","author_short":["Blanqui, F.","Ly, K. Q."],"bibdata":{"bibtype":"article","type":"article","title":"Automated verification of termination certificates","url":"https://core.ac.uk/display/24786286?recSetID=","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","language":"en-gb","urldate":"2021-01-29","author":[{"propositions":[],"lastnames":["Blanqui"],"firstnames":["Frédéric"],"suffixes":[]},{"propositions":[],"lastnames":["Ly"],"firstnames":["Kim","Quyen"],"suffixes":[]}],"year":"2012","keywords":"⛔ No DOI found","bibtex":"@article{blanqui_automated_2012,\n\ttitle = {Automated verification of termination certificates},\n\turl = {https://core.ac.uk/display/24786286?recSetID=},\n\tabstract = {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},\n\tlanguage = {en-gb},\n\turldate = {2021-01-29},\n\tauthor = {Blanqui, Frédéric and Ly, Kim Quyen},\n\tyear = {2012},\n\tkeywords = {⛔ No DOI found},\n}\n\n","author_short":["Blanqui, F.","Ly, K. Q."],"key":"blanqui_automated_2012","id":"blanqui_automated_2012","bibbaseid":"blanqui-ly-automatedverificationofterminationcertificates-2012","role":"author","urls":{"Paper":"https://core.ac.uk/display/24786286?recSetID="},"keyword":["⛔ No DOI found"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/SilverSylvester","dataSources":["YCBcQPneB9oxahSnp"],"keywords":["⛔ no doi found"],"search_terms":["automated","verification","termination","certificates","blanqui","ly"],"title":"Automated verification of termination certificates","year":2012}