[CCF10] A3PAT, an Approach for Certified Automated Termination Proofs

Conférence Internationale avec comité de lecture : PEPM'10 Proceedings of the 2010 ACM SIGPLAN Symposium on Partial Evaluation and Program Manipulation, Madrid, Spain, January 2010, pp.10,

Auteurs: E. Contejean , P. Courtieu , J. Forest , A. Paskevich , O. Pons , X. Urbain

motcle:

Résumé: Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensured. This paper presents the approach developed in Project A3PAT to discover and moreover certify, with full automation, termination proofs for term rewriting systems. It consists of two developments: the Coccinelle library formalises numerous rewriting techniques and termination criteria for the Coq proof assistant; the CiME3 rewriting tool translates termination proofs (discovered by itself or other tools) into traces that are certified by Coq assisted by Coccinelle. The abstraction level of our formalisation allowed us to weaken premises of some theorems known in the literature, thus yielding new termination criteria, such as an extension of the powerful subterm criterion (for which we propose the first full Coq formalisation). Techniques employed in CiME3 also improve on previous works on formalisation and analysis of dependency graphs.

Commentaires: To appear

BibTeX

@inproceedings {
	CCF10,
	title	=	"{A3PAT, an Approach for Certified Automated Termination Proofs}",
	author	=	" E. Contejean and P. Courtieu and J. Forest and A. Paskevich and O. Pons and X. Urbain ",
	booktitle	=	"{PEPM'10 Proceedings of the 2010 ACM SIGPLAN Symposium on Partial Evaluation and Program Manipulation, Madrid, Spain}",
	year	=	2010,
	month	=	"January",
	pages	=	"10",
	note	=	"{To appear }",
}