Difference between revisions of "Publications/kheireddine.21.cp"

From LRDE
 
(2 intermediate revisions by the same user not shown)
Line 2: Line 2:
 
| published = true
  
| published = true
 
| date = 2021-08-31
  
| date = 2021-08-31
−
| authors = Anissa Kheireddine, Étienne Renault, Souheib Baarrir
 +
| authors = Anissa Kheireddine, Étienne Renault, Souheib Baarir
−
| title = Towards better Heuristics for solving Bounded Model Checking Problems
 +
| 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)
 +
| booktitle = Proceedings of the 27th International Conference on Principles and Practice of Constraint Programmings (CP'21)
  +
| editors = Laurent D Michel
  +
| series = Leibniz International Proceedings in Informatics (LIPIcs)
  +
| address = Montpellier, France (Virtual Conference)
  +
| pages = 7:1 to 7:11
  +
| volume = 210
  +
| publisher = Schloss Dagstuhl – Leibniz-Zentrum für Informatik
 
| 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.
  
| 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.
 
| lrdeprojects = Spot
  
| lrdeprojects = Spot
Line 11: Line 17:
 
| type = inproceedings
  
| type = inproceedings
 
| id = kheireddine.21.cp
  
| id = kheireddine.21.cp
  +
| identifier = doi:10.4230/LIPIcs.CP.2021.7
 
| bibtex =
 
| bibtex =
 
@InProceedings<nowiki>{</nowiki> kheireddine.21.cp,
  
@InProceedings<nowiki>{</nowiki> kheireddine.21.cp,
 
author = <nowiki>{</nowiki>Anissa Kheireddine and \'Etienne Renault and Souheib
  
author = <nowiki>{</nowiki>Anissa Kheireddine and \'Etienne Renault and Souheib
−
Baarrir<nowiki>}</nowiki>,
 +
Baarir<nowiki>}</nowiki>,
−
title = <nowiki>{</nowiki>Towards better Heuristics for solving Bounded Model
 +
title = <nowiki>{</nowiki>Towards Better Heuristics for Solving Bounded Model
 
Checking Problems<nowiki>}</nowiki>,
  
Checking Problems<nowiki>}</nowiki>,
 
booktitle = <nowiki>{</nowiki>Proceedings of the 27th International Conference on
  
booktitle = <nowiki>{</nowiki>Proceedings of the 27th International Conference on
−
Principles and Practice of Constraint Programmings (CP)<nowiki>}</nowiki>,
 +
Principles and Practice of Constraint Programmings
  +
(CP'21)<nowiki>}</nowiki>,
  +
editor = <nowiki>{</nowiki>Laurent D. Michel<nowiki>}</nowiki>,
  +
series = <nowiki>{</nowiki>Leibniz International Proceedings in Informatics
  +
(LIPIcs)<nowiki>}</nowiki>,
  +
address = <nowiki>{</nowiki>Montpellier, France (Virtual Conference)<nowiki>}</nowiki>,
 
year = <nowiki>{</nowiki>2021<nowiki>}</nowiki>,
  
year = <nowiki>{</nowiki>2021<nowiki>}</nowiki>,
  +
pages = <nowiki>{</nowiki>7:1--7:11<nowiki>}</nowiki>,
  +
volume = <nowiki>{</nowiki>210<nowiki>}</nowiki>,
  +
publisher = <nowiki>{</nowiki>Schloss Dagstuhl -- Leibniz-Zentrum f<nowiki>{</nowiki>\"u<nowiki>}</nowiki>r Informatik<nowiki>}</nowiki>,
 
month = oct,
  
month = oct,
 
abstract = <nowiki>{</nowiki>This paper presents a new way to improve the performance
  
abstract = <nowiki>{</nowiki>This paper presents a new way to improve the performance
Line 30: Line 45:
 
problem. This paper compares the state-of-the-art approach
  
problem. This paper compares the state-of-the-art approach
 
with two new heuristics: Structure-based and Linear
  
with two new heuristics: Structure-based and Linear
−
Programming heuristics and show promising results.<nowiki>}</nowiki>
 +
Programming heuristics and show promising results.<nowiki>}</nowiki>,
  +
doi = <nowiki>{</nowiki>10.4230/LIPIcs.CP.2021.7<nowiki>}</nowiki>,
  +
isbn = <nowiki>{</nowiki>978-3-95977-211-2<nowiki>}</nowiki>,
  +
issn = <nowiki>{</nowiki>1868-8969<nowiki>}</nowiki>
 
<nowiki>}</nowiki>
  
<nowiki>}</nowiki>
   

Latest revision as of 18:49, 10 March 2023

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

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}
}





Retrieved from "https://www.lrde.epita.fr/index.php?title=Publications/kheireddine.21.cp&oldid=128426"