Communication Dans Un Congrès Année : 2025

Mopsa-C with Trace Partitioning and Autosuggestions (Competition Contribution)

Résumé

We present advances we brought to Mopsa for SV-Comp 2025. Most notably, Mopsa now supports bounded trace partitioning, constant widening with thresholds, and can check that all memory has been correctly deallocated. Further, Mopsa now integrates a sound support of bitfields. While Mopsa at SV-Comp previously relied on a fixed, homogeneous set of configurations to verify tasks, it can now automatically leverage semantic information from a previous analysis to trigger heuristic precision improvements in further analyses. With these improvements, Mopsa wins a silver medal in the SoftwareSystems category and ranks fifth in the NoOverflows category.

Fichier principal
Vignette du fichier
article-easychair.pdf (379.82 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-04968769 , version 1 (26-02-2025)

Licence

Identifiants

  • HAL Id : hal-04968769 , version 1

Citer

Raphaël Monat, Abdelraouf Ouadjaout, Antoine Miné. Mopsa-C with Trace Partitioning and Autosuggestions (Competition Contribution). Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2025, May 2025, Hamilton, Ontario, Canada. ⟨hal-04968769⟩
382 Consultations
377 Téléchargements

Partager

  • More