Reproduction Package for CAV 2025 Article `Btor2-Select: Machine Learning Based Algorithm Selection for Hardware Model Checking'
Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
Abstract This artifact is a reproduction package for the article “Btor2-Select: Machine Learning Based Algorithm Selection for Hardware Model Checking”, published at CAV 2025. The artifact has been evaluated and awarded the badges of Available, Functional, and Reusable. It is archived on Zenodo with the DOI 10.5281/zenodo.15485472. The paper investigates machine-learning-based algorithm selection for hardware model checking in the Btor2 language. It proposes a framework to train an algorithm selector that predicts the best available off-the-shelf model checker for a given verification task. The selector then invokes the predicted backend model checker to solve the task. This artifact supports the reproduction of: the training of the algorithm selector using the provided performance data and the evaluation of the algorithm selector (integrated with backend model checkers) against state-of-the-art hardware model checkers. The artifact consists of source code, precompiled executables, and input data used in the training and evaluation of the paper, as well as the results produced from the experiments. Specifically, it includes the selector trained by our framework, the backend verifiers to be selected, a set of Btor2 verification tasks collected for training and evaluation, the experimental data generated from the evaluation, and instructions to run the tools and experiments. Artifact Requirements This reproduction package works best with the SoSy-Lab Virtual Machine, which runs Ubuntu 24.04 LTS and has all the required dependencies installed. If you test the artifact with this VM, you do not need to install any package. Please login the VM as user vagrant via GUI or SSH. The VM has been tested with VirtualBox 7.0 on a Linux (Ubuntu 24.04) computer. The benchmarking framework BenchExec used in our experiments relies on control groups and namespaces provided by modern Linux kernels. Our tool, Btor2-Select, was tested with Python 3.12. Additionally, one of the compared tools, super_prove, is executed in a containerized environment with Podman (tested with version 4.9.3). To perform most of the experiments included in this artifact, a machine with 16 GB of RAM, 4 CPU cores, and 15 GB of disk space is needed. A full reproduction of the training part required around 8.5 hours of wall-clock time on a server equipped with 2 TB of RAM and two 2.0 GHz AMD EPYC 7713 CPUs, each with 128 processing units. The evaluation phase consumed more than 776 hours of CPU time on machines with 3.4 GHz processors. For demonstration purposes, a subset of benchmark tasks can be used. Training on a subset of 450 Btor2 tasks took approximately less than a minute, while evaluation on 30 selected simple Btor2 tasks took roughly 5 minutes on a standard laptop. This artifact README includes time estimates for the various commands referenced throughout. The uncompressed package takes around 14 GB of disk space. Please make sure there is enough disk space available before extracting it. If you only want to run experiments on the bit-vector tasks, you can exclude the directory perf-eval-hwmc/benchmarks/array when unzipping the package. Contents This artifact contains the following items: README.{html,md}: this documentation (we recommend viewing the HTML version with a browser) LICENSE.txt: license information of the artifact btor2-select/: the machine-learning-based framework for algorithm selection and the trained selector (our open-source project, at commit b6505455) bin/: contains the executables of Btor2-Select and Btor2-Para (a parallel portfolio constructed for evaluating Btor2-Select) btor2select/: contains the main production codes for Btor2-Select, including: btor2_select.py: performs inference using the trained selector and executes the selected backend model checker train.py: trains the proposed algorithm selector cross_validation.py: conducts cross-validation analysis Other supporting scripts for different ML models, e.g., PWC-SVM-BoKW, PWC-SVM-WL data/demo/: a small collection of Btor2 verification tasks and their performance data, intended for use in a training demo. README: for additional information perf-eval-hwmc: a directory for evaluating performance of backend model checkers, consisting of: benchmarks/: a set of Btor2 verification tasks collected for training and evaluation dataset/: the performance dataset used for training verifiers/: tool archives of several backend model checkers (including both hardware and software verifiers) benchexec/: a checkout of BenchExec, a reliable benchmarking framework with precise resource management, used to perform the evaluation bench-defs/: benchmark definitions used by BenchExec README: for further information data-submission/: a directory containing the raw and processed data obtained from our experiments cross_val/: the cross-validation results evaluation/: the evaluation results of Btor2-Select, Btor2-Para, ABC, AVR, rIC3, and super_prove paper-results/: the results presented in the paper demo-results/: the results of the demo runs Makefile: a file that assembles commands for running experiments and processing data
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,001 | 0,002 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,001 | 0,001 |
| Études des sciences et des technologies | 0,002 | 0,000 |
| Communication savante | 0,001 | 0,000 |
| Science ouverte | 0,002 | 0,001 |
| Intégrité de la recherche | 0,000 | 0,001 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,002 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle