Towards Better Heuristics for Solving Bounded Model Checking Problems

Authors

Anissa Kheireddine, Étienne Renault, Souheib Baarir

Where

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programmings (CP'21)

Place

Montpellier, France (Virtual Conference)

Type

inproceedings

Publisher

Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Projects

Spot

Date

2021-08-31

Abstract

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.

Documents

• Paper

Bibtex (lrde.bib)

@InProceedings{	  kheireddine.21.cp,
  author	= {Anissa Kheireddine and \'Etienne Renault and Souheib
		  Baarir},
  title		= {Towards Better Heuristics for Solving Bounded Model
		  Checking Problems},
  booktitle	= {Proceedings of the 27th International Conference on
		  Principles and Practice of Constraint Programmings
		  (CP'21)},
  editor	= {Laurent D. Michel},
  series	= {Leibniz International Proceedings in Informatics
		  (LIPIcs)},
  address	= {Montpellier, France (Virtual Conference)},
  year		= {2021},
  pages		= {7:1--7:11},
  volume	= {210},
  publisher	= {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  month		= oct,
  abstract	= {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.},
  doi		= {10.4230/LIPIcs.CP.2021.7},
  isbn		= {978-3-95977-211-2},
  issn		= {1868-8969}
}