Difference between revisions of "Publications/kheireddine.22.constraints"
From LRDE
(Created page with "{{Publication | published = true | date = 2022-12-09 | authors = Anissa Kheireddine, Étienne Renault, Souheib Baarrir | title = Towards Better Heuristics for Solving Bounded...") |
|||
Line 10: | Line 10: | ||
| volume = ??? |
| volume = ??? |
||
| publisher = Schloss Dagstuhl – Leibniz-Zentrum für Informatik |
| 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 on sequential and parallel procedures 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. |
+ | | abstract = This paper presents a new way to improve the performance of the SAT-based bounded model checking problem on sequential and parallel procedures 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 approaches with two new heuristics for sequential procedures: Structure-based and Linear Programming heuristics. We extend these study and applied the above methodology on parallel approaches, especially to refine the sharing measure which shows promising results. |
| lrdeprojects = Spot |
| lrdeprojects = Spot |
||
| lrdepaper = http://www.lrde.epita.fr/dload/papers/kheireddine.22.constraints.pdf |
| lrdepaper = http://www.lrde.epita.fr/dload/papers/kheireddine.22.constraints.pdf |
Revision as of 09:49, 21 December 2022
- Authors
- Anissa Kheireddine, Étienne Renault, Souheib Baarrir
- Journal
- Constraints
- Type
- article
- Publisher
- Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- Projects
- Spot
- Date
- 2022-12-09
Abstract
This paper presents a new way to improve the performance of the SAT-based bounded model checking problem on sequential and parallel procedures 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 approaches with two new heuristics for sequential procedures: Structure-based and Linear Programming heuristics. We extend these study and applied the above methodology on parallel approaches, especially to refine the sharing measure which shows promising results.
Documents
Bibtex (lrde.bib)
@Article{ kheireddine.22.constraints, author = {Anissa Kheireddine and \'Etienne Renault and Souheib Baarrir}, title = {Towards Better Heuristics for Solving Bounded Model Checking Problems}, journal = {Constraints}, editor = {Mark Wallace}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, year = {???}, pages = {???}, volume = {???}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, month = {???}, abstract = {This paper presents a new way to improve the performance of the SAT-based bounded model checking problem on sequential and parallel procedures 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 approaches with two new heuristics for sequential procedures: Structure-based and Linear Programming heuristics. We extend these study and applied the above methodology on parallel approaches, especially to refine the sharing measure which shows promising results.}, doi = {10.4230/LIPIcs.CONSTRAINTS.2022}, isbn = {???}, issn = {???} }