A3PAT, an approach for certified automated termination proofs

doi:10.1145/1706356.1706370

A3PAT, an approach for certified automated termination proofs

Full Text:

Pdf

Buy this Article

Authors:	Évelyne Contejean	Université Paris-Sud 11 and CNRS, Orsay F-91405, France
	Andrei Paskevich	Université Paris-Sud 11 and CNRS, Orsay F-91405, France
	Xavier Urbain	Université Paris-Sud 11 and CNRS and École nationale supérieure d'informatique pour l'industrie et l'entreprise, Orsay F-91405, France
	Pierre Courtieu	Conservatoire National des Arts et Métiers, Paris F-75141, France
	Olivier Pons	Conservatoire National des Arts et Métiers, Paris F-75141, France
	Julien Forest	École nationale supérieure d'informatique pour l'industrie et l'entreprise, Évry F-91025, France

	2010 Article
Bibliometrics
· Downloads (6 Weeks): 3 · Downloads (12 Months): 19 · Downloads (cumulative): 76 · Citation Count: 5

Published in:

	· Proceeding
	PEPM '10 Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
	Pages 63-72 ACM New York, NY, USA ©2010 table of contents ISBN: 978-1-60558-727-1 doi>10.1145/1706356.1706370

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Tags: automated reasoning deduction and theorem proving formal proof specifying and verifying and reasoning about programs term rewriting termination theory verification

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player