No description
-
2005 (v1)PublicationUploaded on: May 13, 2023
-
February 24, 2022 (v1)Journal article
Most modern object-oriented software systems are variability-rich, despite that they may not be developed as product lines. Their variability is implemented by several traditional techniques in combination, such as inheritance, overloading, or design patterns. As domain features or variation points with variants are not a by-product of these...
Uploaded on: December 3, 2022 -
July 14, 2018 (v1)Conference paper
International audience
Uploaded on: December 3, 2022 -
July 1, 2019 (v1)Conference paper
Le solveur SAT est devenu un oracle NP e cace pour résoudre des problèmes NP-complet (voir au-delà). En gé-néral, ces problèmes sont résolus soit par une traduction di-recte vers SAT soit en résolvant itérativement des problèmes SAT dans une procédure comme CEGAR. Récemment, une nouvelle boucle CEGAR récursive travaillant sur deux ni-veaux...
Uploaded on: December 4, 2022 -
October 30, 2018 (v1)Conference paper
SAT solvers have become efficient for solving NP-complete problems (and beyond). Usually those problems are solved by direct translation to SAT or by solving iteratively SAT problems in a procedure like CEGAR. Recently, a new recur-sive CEGAR loop working with two abstraction levels, called RECAR, was proposed and instantiated for modal logic...
Uploaded on: December 4, 2022 -
July 2, 2016 (v1)Conference paper
This article presents our work toward a rigorous experimental comparison of state-of-the-art solvers for the resolution of the satisfiability of formulae in modal logic K. Our aim is to provide a pragmatic way to verify the answers provided by those solvers. For this purpose, we propose a certificate format and a checker to validate Kripke...
Uploaded on: December 4, 2022 -
August 19, 2017 (v1)Conference paper
International audience
Uploaded on: December 4, 2022 -
February 4, 2017 (v1)Conference paper
We present a SAT-based approach for solving the modal logic S5-satisfiability problem. That problem being NP-complete, the translation into SAT is not a surprise. Our contribution is to greatly reduce the number of propositional variables and clauses required to encode the problem. We first present a syntactic property called diamond degree. We...
Uploaded on: December 4, 2022 -
May 29, 2017 (v1)Publication
Variability determines the capability of software applications to be configured and customized. A common need during the development of variability–intensive systems is the automated analysis of their underlying variability models, e.g. detecting contradictory configuration options. The analysis operations that are performed on variability...
Uploaded on: March 27, 2023 -
January 12, 2022 (v1)Publication
Variability determines the ability of software applications to be configured and customized. A common need during the development of variability–intensive systems is the automated analysis of their underlying variability models, e.g. detecting contradictory configuration options. The analysis operations that are performed on variability models...
Uploaded on: March 25, 2023