Passer à la navigation principale Passer à la recherche Passer au contenu principal

Automatic Test-Case Reduction in Proof Assistants: A Case Study in Coq

  • MIT Computer Science & Artificial Intelligence Laboratory
  • Machine Intelligence Research Institute
  • Laboratoire de Probabilités et Modèles Aléatoires
  • Reed College

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collectionContribution à une conférenceRevue par des pairs

Résumé

As the adoption of proof assistants increases, there is a need for efficiency in identifying, documenting, and fixing compatibility issues that arise from proof-assistant evolution. We present the Coq Bug Minimizer, a tool for reproducing buggy behavior with minimal and standalone files, integrated with coqbot to trigger automatically on failures from Coq's reverse dependency compatibility testing. Our tool eliminates the overhead of having to download, set up, compile, and then explore and understand large developments, enabling Coq developers to easily obtain modular test-case files for fast experimentation. In this paper, we describe insights about how test-case reduction is different in Coq than in traditional compilers. We expect that our insights will generalize to other proof assistants. We evaluate the Coq Bug Minimizer on over 150 compatibility testing failures. Our tool succeeds in reducing failures to smaller test cases roughly 75% of the time. The minimizer produces a fully standalone test case 89% of the time, and it is on average about one-third the size of the original test. The average reduced test case compiles in 1.25 seconds, with 75% taking under half a second.

langue originaleAnglais
titre13th International Conference on Interactive Theorem Proving, ITP 2022
rédacteurs en chefJune Andronick, Leonardo de Moura
EditeurSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronique)9783959772525
Les DOIs
étatPublié - 1 août 2022
Modification externeOui
Evénement13th International Conference on Interactive Theorem Proving, ITP 2022 - Haifa, Israël
Durée: 7 août 202210 août 2022

Série de publications

NomLeibniz International Proceedings in Informatics, LIPIcs
Volume237
ISSN (imprimé)1868-8969

Une conférence

Une conférence13th International Conference on Interactive Theorem Proving, ITP 2022
Pays/TerritoireIsraël
La villeHaifa
période7/08/2210/08/22

Empreinte digitale

Examiner les sujets de recherche de « Automatic Test-Case Reduction in Proof Assistants: A Case Study in Coq ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation