Difference between revisions of "Publications/kheireddine.22.constraints"
From LRDE
(One intermediate revision by the same user not shown) | |||
Line 2: | Line 2: | ||
| published = true |
| published = true |
||
| date = 2022-12-09 |
| date = 2022-12-09 |
||
− | | authors = Anissa Kheireddine, Étienne Renault, Souheib |
+ | | 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 |
||
| journal = Constraints |
| journal = Constraints |
||
| editors = Mark Wallace |
| editors = Mark Wallace |
||
| series = Leibniz International Proceedings in Informatics (LIPIcs) |
| series = Leibniz International Proceedings in Informatics (LIPIcs) |
||
− | | pages = |
+ | | pages = 45 to 66 |
− | | volume = |
+ | | volume = 28 |
− | | publisher = |
+ | | publisher = Springer |
| 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. |
| 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 |
||
| lrdenewsdate = 2022-12-09 |
| lrdenewsdate = 2022-12-09 |
||
+ | | note = First published online on 27 December 2022. |
||
| type = article |
| type = article |
||
| id = kheireddine.22.constraints |
| id = kheireddine.22.constraints |
||
− | | identifier = doi:10. |
+ | | identifier = doi:10.1007/s10601-022-09339-8 |
| bibtex = |
| bibtex = |
||
@Article<nowiki>{</nowiki> kheireddine.22.constraints, |
@Article<nowiki>{</nowiki> kheireddine.22.constraints, |
||
author = <nowiki>{</nowiki>Anissa Kheireddine and \'Etienne Renault and Souheib |
author = <nowiki>{</nowiki>Anissa Kheireddine and \'Etienne Renault and Souheib |
||
− | + | 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>, |
||
Line 27: | Line 28: | ||
series = <nowiki>{</nowiki>Leibniz International Proceedings in Informatics |
series = <nowiki>{</nowiki>Leibniz International Proceedings in Informatics |
||
(LIPIcs)<nowiki>}</nowiki>, |
(LIPIcs)<nowiki>}</nowiki>, |
||
− | year = <nowiki>{</nowiki> |
+ | year = <nowiki>{</nowiki>2023<nowiki>}</nowiki>, |
− | pages = <nowiki>{</nowiki> |
+ | pages = <nowiki>{</nowiki>45--66<nowiki>}</nowiki>, |
− | volume = <nowiki>{</nowiki> |
+ | volume = <nowiki>{</nowiki>28<nowiki>}</nowiki>, |
− | publisher = <nowiki>{</nowiki> |
+ | publisher = <nowiki>{</nowiki>Springer<nowiki>}</nowiki>, |
− | month = |
+ | month = mar, |
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 |
||
of the SAT-based bounded model checking problem on |
of the SAT-based bounded model checking problem on |
||
Line 45: | Line 46: | ||
the above methodology on parallel approaches, especially to |
the above methodology on parallel approaches, especially to |
||
refine the sharing measure which shows promising results.<nowiki>}</nowiki>, |
refine the sharing measure which shows promising results.<nowiki>}</nowiki>, |
||
− | doi = <nowiki>{</nowiki>10. |
+ | doi = <nowiki>{</nowiki>10.1007/s10601-022-09339-8<nowiki>}</nowiki>, |
− | + | note = <nowiki>{</nowiki>First published online on 27 December 2022.<nowiki>}</nowiki> |
|
− | issn = <nowiki>{</nowiki>???<nowiki>}</nowiki> |
||
<nowiki>}</nowiki> |
<nowiki>}</nowiki> |
||
Latest revision as of 18:49, 10 March 2023
- Authors
- Anissa Kheireddine, Étienne Renault, Souheib Baarir
- Journal
- Constraints
- Type
- article
- Publisher
- Springer
- 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 Baarir}, title = {Towards Better Heuristics for Solving Bounded Model Checking Problems}, journal = {Constraints}, editor = {Mark Wallace}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, year = {2023}, pages = {45--66}, volume = {28}, publisher = {Springer}, month = mar, 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.1007/s10601-022-09339-8}, note = {First published online on 27 December 2022.} }