Towards Better Heuristics for Solving Bounded Model Checking Problems - Laboratoire d'Informatique de Paris 6 Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Towards Better Heuristics for Solving Bounded Model Checking Problems

Résumé

This paper presents a new way to improve the performance of the SAT-based bounded model checking problem by exploiting relevant information identified through the characteristics of the original problem. This led us to design a new way of building interesting heuristics based on the structure of the underlying problem. The proposed methodology is generic and can be applied for any SAT problem. This paper compares the state-of-the-art approach with two new heuristics: Structure-based and Linear Programming heuristics and show promising results.
Fichier principal
Vignette du fichier
kheireddine.21.cp.pdf (668.78 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-04580372 , version 1 (19-05-2024)

Identifiants

Citer

Anissa Kheireddine, Étienne Renault, Souheib Baarir. Towards Better Heuristics for Solving Bounded Model Checking Problems. 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), Oct 2021, Montpellier (Virtual Conference), France. pp.7:1--7:11, ⟨10.4230/LIPIcs.CP.2021.7⟩. ⟨hal-04580372⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More