From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Automated Certified Proofs with CiME3.

E. Contejean, P. Courtieu, J. Forest, O. Pons, и X. Urbain. RTA, том 10 из LIPIcs, стр. 21-30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Automated Certified Proofs with CiME3.E. Contejean, P. Courtieu, J. Forest, O. Pons, и X. Urbain. RTA, том 10 из LIPIcs, стр. 21-30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Certifying a Termination Criterion Based on Graphs, without Graphs.P. Courtieu, J. Forest, и X. Urbain. TPHOLs, том 5170 из Lecture Notes in Computer Science, стр. 183-198. Springer, (2008)Expression Reduction Systems with Patterns.J. Forest, и D. Kesner. RTA, том 2706 из Lecture Notes in Computer Science, стр. 107-122. Springer, (2003)A3PAT, an approach for certified automated termination proofs.E. Contejean, A. Paskevich, X. Urbain, P. Courtieu, O. Pons, и J. Forest. PEPM, стр. 63-72. ACM, (2010)A Weak Calculus with Explicit Operators for Pattern Matching and Substitution.J. Forest. RTA, том 2378 из Lecture Notes in Computer Science, стр. 174-191. Springer, (2002)Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant.G. Barthe, J. Forest, D. Pichardie, и V. Rusu. FLOPS, том 3945 из Lecture Notes in Computer Science, стр. 114-129. Springer, (2006)Certification of Automated Termination Proofs.E. Contejean, P. Courtieu, J. Forest, O. Pons, и X. Urbain. FroCoS, том 4720 из Lecture Notes in Computer Science, стр. 148-162. Springer, (2007)