default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSouheib Baarir
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c44]Anissa Kheireddine, Etienne Renault, Souheib Baarir:
Interpolation-Based Learning for Bounded Model Checking. ENASE 2024: 605-614- [c43]Hao Xu
, Souheib Baarir, Tewfik Ziadi, Siham Essodaigui, Yves Bossu:
Automated Parameter Determination for Enhancing the Product Configuration System of Renault: An Experience Report. ICECCS 2024: 43-63 - [c42]Sabrine Saouli, Souheib Baarir, Claude Dutheillet:
Tackling the Polarity Initialization Problem in SAT Solving Using a Genetic Algorithm. NFM 2024: 21-36 - 2023
- [j8]Anissa Kheireddine, Etienne Renault, Souheib Baarir:
Towards better heuristics for solving bounded model checking problems. Constraints An Int. J. 28(1): 45-66 (2023) - [c41]Hao Xu, Souheib Baarir, Tewfik Ziadi, Siham Essodaigui, Yves Bossu, Lom-Messan Hillah:
An Experience Report on the Optimization of the Product Configuration System of Renault *. ICECCS 2023: 197-206 - [c40]Hao Xu, Souheib Baarir, Tewfik Ziadi, Siham Essodaigui, Yves Bossu, Lom-Messan Hillah:
Optimization of the Product Configuration System of Renault. SAC 2023: 1486-1489 - [c39]Vincent Vallade, Julien Sopena, Souheib Baarir:
Enhancing State-of-the-Art Parallel SAT Solvers Through Optimized Sharing Policies. POS@SAT 2023: 35-45 - [c38]Sabrine Saouli, Souheib Baarir, Claude Dutheillet, Jo Devriendt:
CosySEL: Improving SAT Solving Using Local Symmetries. VMCAI 2023: 252-266 - 2022
- [j7]Sara Houhou, Souheib Baarir, Pascal Poizat, Philippe Quéinnec, Laïd Kahloul:
A First-Order Logic verification framework for communication-parametric and time-aware BPMN collaborations. Inf. Syst. 104: 101765 (2022) - [c37]Anissa Kheireddine, Etienne Renault, Souheib Baarir:
Tuning SAT solvers for LTL Model Checking. APSEC 2022: 259-268 - [c36]Vincent Vallade, Saeed Nejati, Julien Sopena, Souheib Baarir, Vijay Ganesh:
Diversifying a Parallel SAT Solver with Bayesian Moment Matching. SETTA 2022: 227-233 - 2021
- [c35]Anissa Kheireddine, Etienne Renault, Souheib Baarir:
Towards Better Heuristics for Solving Bounded Model Checking Problems (Short Paper). CP 2021: 7:1-7:11 - [c34]Sara Houhou, Souheib Baarir, Pascal Poizat, Philippe Quéinnec:
A Direct Formal Semantics for BPMN Time-related Constructs. ENASE 2021: 138-149 - [c33]Hao Xu, Souheib Baarir, Tewfik Ziadi, Lom-Messan Hillah, Siham Essodaigui, Yves Bossu:
Optimisation for the product configuration system of Renault: towards an integration of symmetries. SPLC (B) 2021: 86-90 - 2020
- [c32]Yackolley Amoussou-Guenou, Souheib Baarir, Maria Potop-Butucaru, Nathalie Sznajder, Léo Tible, Sébastien Tixeuil:
On the Encoding and Solving of Partial Information Games. NETYS 2020: 60-76 - [c31]Vincent Vallade, Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Fabrice Kordon:
On the Usefulness of Clause Strengthening in Parallel SAT Solving. NFM 2020: 222-229 - [c30]Vincent Vallade, Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Vijay Ganesh, Fabrice Kordon:
Community and LBD-Based Clause Sharing Policy for Parallel SAT Solving. SAT 2020: 11-27 - [c29]Samir Tigane, Laïd Kahloul, Souheib Baarir, Samir Bourekkache:
Dynamic GSPNs: formal definition, transformation towards GSPNs and formal verification. VALUETOOLS 2020: 164-171
2010 – 2019
- 2019
- [j6]Samir Tigane, Laïd Kahloul, Saber Benharzallah, Souheib Baarir, Samir Bourekkache:
Reconfigurable GSPNs: A modeling formalism of evolvable discrete-event systems. Sci. Comput. Program. 183 (2019) - [c28]Sara Houhou, Souheib Baarir, Pascal Poizat, Philippe Quéinnec:
A First-Order Logic Semantics for Communication-Parametric BPMN Collaborations. BPM 2019: 52-68 - [c27]Hakan Metin, Souheib Baarir, Fabrice Kordon:
Composing Symmetry Propagation and Effective Symmetry Breaking for SAT Solving. NFM 2019: 316-332 - [c26]Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Fabrice Kordon:
Modular and Efficient Divide-and-Conquer SAT Solver on Top of the Painless Framework. TACAS (1) 2019: 135-151 - 2018
- [j5]Samir Tigane, Laïd Kahloul, Samir Bourekkache, Souheib Baarir:
Extending GSPNs for the modelling, analysis and performance evaluation of dynamic systems. Int. J. Crit. Comput. Based Syst. 8(1): 25-44 (2018) - [c25]Souheib Baarir, Reda Bendraou, Hakan Metin, Yoann Laurent:
ProVer: an SMT-based approach for process verification. MoDELS (Workshops) 2018: 555-562 - [c24]Hakan Metin, Souheib Baarir, Maximilien Colange, Fabrice Kordon:
CDCLSym: Introducing Effective Symmetry Breaking in SAT Solving. TACAS (1) 2018: 99-114 - 2017
- [c23]Tarek Menouer, Souheib Baarir:
Parallel Learning Portfolio-based solvers. ICCS 2017: 335-344 - [c22]Souheib Baarir, Kais Klai:
First international workshop on verification of business and software processes. ICSSP 2017: 143-144 - [c21]Tarek Menouer, Souheib Baarir:
Parallel Satisfiability Solver Based on Hybrid Partitioning Method. PDP 2017: 54-60 - [c20]Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Fabrice Kordon:
PaInleSS: A Framework for Parallel SAT Solving. SAT 2017: 233-250 - 2015
- [c19]Souheib Baarir, Alexandre Duret-Lutz:
SAT-Based Minimization of Deterministic \omega -Automata. LPAR 2015: 79-87 - [c18]Djamel Eddine Khelladi, Reda Bendraou, Souheib Baarir, Yoann Laurent, Marie-Pierre Gervais:
A framework to formally verify conformance of a software process to a software method. SAC 2015: 1518-1525 - 2014
- [c17]Yoann Laurent, Reda Bendraou, Souheib Baarir, Marie-Pierre Gervais:
Formalization of fUML: An Application to Process Verification. CAiSE 2014: 347-363 - [c16]Yoann Laurent, Reda Bendraou, Souheib Baarir, Marie-Pierre Gervais:
Alloy4SPV : A Formal Framework for Software Process Verification. ECMFA 2014: 83-100 - [c15]Souheib Baarir, Alexandre Duret-Lutz:
Mechanizing the Minimization of Deterministic Generalized Büchi Automata. FORTE 2014: 266-283 - [c14]Yoann Laurent, Reda Bendraou, Souheib Baarir, Marie-Pierre Gervais:
Planning for declarative processes. SAC 2014: 1126-1133 - 2013
- [c13]Maximilien Colange, Souheib Baarir, Fabrice Kordon, Yann Thierry-Mieg:
Towards Distributed Software Model-Checking Using Decision Diagrams. CAV 2013: 830-845 - 2012
- [c12]Maximilien Colange, Fabrice Kordon, Yann Thierry-Mieg, Souheib Baarir:
State Space Analysis Using Symmetries on Decision Diagrams. ACSD 2012: 164-172 - 2011
- [j4]Souheib Baarir, Cécile Braunstein, Emmanuelle Encrenaz, Jean-Michel Ilié, Isabelle Mounier, Denis Poitrenaud, Sana Younès:
Feasibility analysis for robustness quantification by symbolic model checking. Formal Methods Syst. Des. 39(2): 165-184 (2011) - [j3]Souheib Baarir, Marco Beccuti, Claude Dutheillet, Giuliana Franceschinis, Serge Haddad:
Lumping partially symmetrical stochastic models. Perform. Evaluation 68(1): 21-44 (2011) - [c11]Maximilien Colange, Souheib Baarir, Fabrice Kordon, Yann Thierry-Mieg:
Crocodile: A Symbolic/Symbolic Tool for the Analysis of Symmetric Nets with Bag. Petri Nets 2011: 338-347 - 2010
- [c10]Souheib Baarir, Lom-Messan Hillah, Fabrice Kordon, Etienne Renault:
Self-reconfigurable Modular Robots and Their Symbolic Configuration Space. Monterey Workshop 2010: 103-121
2000 – 2009
- 2009
- [j2]Souheib Baarir, Marco Beccuti, Davide Cerotti, Massimiliano De Pierro, Susanna Donatelli, Giuliana Franceschinis:
The GreatSPN tool: recent enhancements. SIGMETRICS Perform. Evaluation Rev. 36(4): 4-9 (2009) - [j1]Julien Sopena, Souheib Baarir, Fabrice Legond-Aubry:
Vérification formelle d'un algorithme générique et hiérarchique d'exclusion mutuelle. Tech. Sci. Informatiques 28(9): 1085-1105 (2009) - [c9]Souheib Baarir, Cécile Braunstein, Renaud Clavel, Emmanuelle Encrenaz, Jean-Michel Ilié, Régis Leveugle, Isabelle Mounier, Laurence Pierre, Denis Poitrenaud:
Complementary Formal Approaches for Dependability Analysis. DFT 2009: 331-339 - [c8]Souheib Baarir, Marco Beccuti, Claude Dutheillet, Giuliana Franceschinis:
From partially to fully lumped Markov chains in stochastic well formed Petri nets. VALUETOOLS 2009: 43 - 2008
- [c7]Souheib Baarir, Julien Sopena, Fabrice Legond-Aubry:
Verification of a Hierarchical Generic Mutual Exclusion Algorithm. FORTE 2008: 99-115 - [c6]Souheib Baarir, Marco Beccuti, Giuliana Franceschinis:
New Solvers for Asymmetric Systems in GreatSPN. QEST 2008: 235-236 - 2007
- [c5]Souheib Baarir, Alexandre Duret-Lutz:
Emptiness Check of Powerset Buchi Automata using Inclusion Tests. ACSD 2007: 41-50 - 2006
- [c4]Marco Beccuti, Giuliana Franceschinis, Souheib Baarir, Jean-Michel Ilié:
Efficient lumpability check in partially symmetric systems. QEST 2006: 211-220 - 2005
- [c3]Souheib Baarir, Claude Dutheillet, Serge Haddad, Jean-Michel Ilié:
On the use of exact lumpability in partially symmetricalWell-formed Nets. QEST 2005: 23-32 - 2004
- [c2]Jean-Michel Ilié, Souheib Baarir, Marco Beccuti, Clément Delamare, Susanna Donatelli, Claude Dutheillet, Giuliana Franceschinis, Rossano Gaeta, Patrice Moreaux:
Extended SWN Solvers in GreatSPN. QEST 2004: 324-325 - [c1]Jérôme Hugues, Thomas Vergnaud, Laurent Pautet, Yann Thierry-Mieg, Souheib Baarir, Fabrice Kordon:
On the Formal Verification of Middleware Behavioral Properties. FMICS 2004: 139-157
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
