Evaluating state-of-the-art # SAT solvers on industrial configuration spaces

Product lines are widely used to manage families of products that share a common base of features. Typically, not every combination (configuration) of features is valid. Feature models are a de facto standard to specify valid configurations and allow standardized analyses on the variability of the u...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Empirical software engineering : an international journal Jg. 28; H. 2; S. 29
Hauptverfasser: Sundermann, Chico, Heß, Tobias, Nieke, Michael, Bittner, Paul Maximilian, Young, Jeffrey M., Thüm, Thomas, Schaefer, Ina
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.03.2023
Springer Nature B.V
Schlagworte:
ISSN:1382-3256, 1573-7616
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Product lines are widely used to manage families of products that share a common base of features. Typically, not every combination (configuration) of features is valid. Feature models are a de facto standard to specify valid configurations and allow standardized analyses on the variability of the underlying system. A large variety of such analyses depends on computing the number of valid configurations. To analyze feature models, they are typically translated to propositional logic. This allows to employ # SAT solvers that compute the number of satisfying assignments of the propositional formula translated from a feature model. However, the # SAT problem is generally assumed to be even harder than SAT and its scalability when applied to feature models has only been explored sparsely. Our main contribution is an investigation of the performance of off-the-shelf # SAT solvers on computing the number of valid configurations for industrial feature models. We empirically evaluate 21 publicly available # SAT solvers on 130 feature models from 15 subject systems. Our results indicate that current solvers master a majority of the evaluated systems (13/15) with the fastest solvers requiring less than one second for each successfully evaluated feature model. However, there are two complex systems for which none of the evaluated solvers scales. For the given experiment design, the solvers that consumed the least runtime are sharpSAT (2.5 seconds in sum for the 13 systems) and Ganak (3.5 seconds).
AbstractList Product lines are widely used to manage families of products that share a common base of features. Typically, not every combination (configuration) of features is valid. Feature models are a de facto standard to specify valid configurations and allow standardized analyses on the variability of the underlying system. A large variety of such analyses depends on computing the number of valid configurations. To analyze feature models, they are typically translated to propositional logic. This allows to employ # SAT solvers that compute the number of satisfying assignments of the propositional formula translated from a feature model. However, the # SAT problem is generally assumed to be even harder than SAT and its scalability when applied to feature models has only been explored sparsely. Our main contribution is an investigation of the performance of off-the-shelf # SAT solvers on computing the number of valid configurations for industrial feature models. We empirically evaluate 21 publicly available # SAT solvers on 130 feature models from 15 subject systems. Our results indicate that current solvers master a majority of the evaluated systems (13/15) with the fastest solvers requiring less than one second for each successfully evaluated feature model. However, there are two complex systems for which none of the evaluated solvers scales. For the given experiment design, the solvers that consumed the least runtime are sharpSAT (2.5 seconds in sum for the 13 systems) and Ganak (3.5 seconds).
Product lines are widely used to manage families of products that share a common base of features. Typically, not every combination (configuration) of features is valid. Feature models are a de facto standard to specify valid configurations and allow standardized analyses on the variability of the underlying system. A large variety of such analyses depends on computing the number of valid configurations. To analyze feature models, they are typically translated to propositional logic. This allows to employ SAT solvers that compute the number of satisfying assignments of the propositional formula translated from a feature model. However, the SAT problem is generally assumed to be even harder than SAT and its scalability when applied to feature models has only been explored sparsely. Our main contribution is an investigation of the performance of off-the-shelf SAT solvers on computing the number of valid configurations for industrial feature models. We empirically evaluate 21 publicly available SAT solvers on 130 feature models from 15 subject systems. Our results indicate that current solvers master a majority of the evaluated systems (13/15) with the fastest solvers requiring less than one second for each successfully evaluated feature model. However, there are two complex systems for which none of the evaluated solvers scales. For the given experiment design, the solvers that consumed the least runtime are (2.5 seconds in sum for the 13 systems) and (3.5 seconds).
ArticleNumber 29
Author Sundermann, Chico
Bittner, Paul Maximilian
Young, Jeffrey M.
Schaefer, Ina
Thüm, Thomas
Heß, Tobias
Nieke, Michael
Author_xml – sequence: 1
  givenname: Chico
  orcidid: 0000-0002-5239-3307
  surname: Sundermann
  fullname: Sundermann, Chico
  email: chico.sundermann@uni-ulm.de
  organization: University of Ulm
– sequence: 2
  givenname: Tobias
  surname: Heß
  fullname: Heß, Tobias
  organization: University of Ulm
– sequence: 3
  givenname: Michael
  surname: Nieke
  fullname: Nieke, Michael
  organization: Technische Universität Braunschweig
– sequence: 4
  givenname: Paul Maximilian
  surname: Bittner
  fullname: Bittner, Paul Maximilian
  organization: University of Ulm
– sequence: 5
  givenname: Jeffrey M.
  surname: Young
  fullname: Young, Jeffrey M.
  organization: IOHK
– sequence: 6
  givenname: Thomas
  surname: Thüm
  fullname: Thüm, Thomas
  organization: University of Ulm
– sequence: 7
  givenname: Ina
  surname: Schaefer
  fullname: Schaefer, Ina
  organization: Technische Universität Braunschweig
BookMark eNp9kE1PwzAMhiM0JLbBH-BUaedAEjdJe5ym8SFN4sA4R2mbjk4lGUk6iX9PWJGQOOxky_bj135naGKdNQjdUnJHCZH3gRIhckwYw5QwwXF5gaaUS8BSUDFJORQMA-PiCs1C2BNCSpnzKdqsj7ofdOzsLgtRR4Ndi-O7wdrHbJG9LrdZcP3R-JA5m3W2GUL0ne6z2tm22w0-oakRDro24RpdtroP5uY3ztHbw3q7esKbl8fn1XKDaxAQcUMBSMsrpmUNUhQAOm8pCFqwynDCiTGMVpBaWlekom3BIW-KkkvZpALAHC3GvQfvPgcTotq7wdskqZgUnLGCkjxNsXGq9i4Eb1p18N2H9l-KEvXjmhpdU8k1dXJNlQkq_kF1F08_Rq-7_jwKIxqSjt0Z_3fVGeobC2OCKg
CitedBy_id crossref_primary_10_1145_3689747
crossref_primary_10_1145_3712193
crossref_primary_10_1016_j_jss_2025_112434
crossref_primary_10_1007_s10472_023_09906_6
Cites_doi 10.3233/SAT190039
10.1016/0304-3975(79)90044-6
10.1016/j.scico.2012.12.004
10.4300/JGME-D-12-00156.1
10.1613/jair.989
10.1016/j.scico.2009.12.004
10.1109/TSE.2014.2331073
10.1007/s11219-010-9127-2
10.1007/s10664-014-9336-6
10.1109/TC.1986.1676819
10.1016/j.jss.2009.09.042
10.1177/172460080201700213
10.1145/3459080
10.1002/smr.534
10.1002/(SICI)1096-908X(199911/12)11:6<391::AID-SMR199>3.0.CO;2-8
10.1016/j.is.2010.01.001
10.3166/jancl.11.11-34
10.1049/iet-sen.2010.0022
10.3233/SAT190075
10.1080/01621459.1972.10481251
10.1613/jair.2490
10.1142/S0218194013500368
10.1109/SPLINE.2007.12
10.1145/3093335.2993248
10.1145/3336294.3336322
10.1145/3382025.3414946
10.1109/SPLINE.2007.24
10.1080/00031305.1981.10479327
10.1007/978-3-319-10428-7_7
10.1007/978-3-642-40627-0_18
10.1007/11499107_24
10.1109/ICCAD.1993.580029
10.1007/11554844_3
10.1007/11814948_38
10.4204/EPTCS.29.5
10.1109/ICST.2010.43
10.1007/978-3-319-24318-4_5
10.1007/978-3-030-30048-7_29
10.1145/2884781.2884823
10.1007/978-3-642-40196-1_16
10.1145/3377024.3377036
10.1145/3109729.3109751
10.1145/1639950.1640002
10.1145/3106237.3106252
10.24963/ijcai.2019/163
10.1145/3377024.3377025
10.24963/ijcai.2018/185
10.1145/2934466.2934478
10.1145/3442391.3442404
10.1145/3278122.3278123
10.1007/11499107_17
10.1007/978-3-642-04244-7_13
10.1017/CBO9780511810275
10.1145/3336294.3336297
10.1109/ICST.2019.00032
10.1145/3461001.3474452
10.1002/9780470479216.corpsy0524
10.1007/978-3-319-14130-5_20
10.1007/3-540-47833-7_3
10.24963/ijcai.2017/93
10.1145/3368089.3409744
10.1145/3442391.3442410
10.1007/11877028_16
10.1145/3106237.3106273
10.1109/SPLC.2011.53
10.1145/3180155.3180159
10.1109/ASE.2011.6100068
10.1007/978-3-642-37521-7
10.1109/SPLC.2011.47
10.1109/ICSE.2009.5070568
10.1145/3001867.3001870
10.1109/ICSE.2019.00091
10.1007/978-3-319-10575-8_7
ContentType Journal Article
Copyright The Author(s) 2023
The Author(s) 2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: The Author(s) 2023
– notice: The Author(s) 2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID C6C
AAYXX
CITATION
7SC
8FD
8FE
8FG
ABJCF
AFKRA
ARAPS
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
JQ2
L6V
L7M
L~C
L~D
M7S
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
S0W
DOI 10.1007/s10664-022-10265-9
DatabaseName Springer Nature OA Free Journals
CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central
Technology collection
ProQuest One Community College
ProQuest Central
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Engineering Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Proquest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DELNET Engineering & Technology Collection
DatabaseTitle CrossRef
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Engineering Collection
Advanced Technologies & Aerospace Collection
Engineering Database
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest DELNET Engineering and Technology Collection
Materials Science & Engineering Collection
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList
CrossRef
Technology Collection
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1573-7616
ExternalDocumentID 10_1007_s10664_022_10265_9
GrantInformation_xml – fundername: Universität Ulm (1055)
– fundername: Deutsche Forschungsgemeinschaft
  grantid: TH 2387/1-1
  funderid: https://doi.org/10.13039/501100001659
GroupedDBID -4Z
-59
-5G
-BR
-EM
-Y2
-~C
.86
.DC
.VR
06D
0R~
0VY
199
1N0
1SB
2.D
203
28-
29G
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
78A
8FE
8FG
8TC
8UJ
95-
95.
95~
96X
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAOBN
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYOK
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSNA
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
B-.
BA0
BBWZM
BDATZ
BENPR
BGLVJ
BGNMA
BSONS
C6C
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
EBLON
EBS
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
KDC
KOV
KOW
L6V
LAK
LLZTM
M4Y
M7S
MA-
N2Q
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
P19
P62
P9O
PF0
PT4
PT5
PTHSS
Q2X
QOK
QOS
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZC
RZE
RZK
S0W
S16
S1Z
S26
S27
S28
S3B
SAP
SCJ
SCLPG
SCO
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
Z7R
Z7S
Z7V
Z7X
Z7Z
Z81
Z83
Z86
Z88
Z8M
Z8N
Z8P
Z8R
Z8T
Z8U
Z8W
Z92
ZMTXR
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
7SC
8FD
DWQXO
JQ2
L7M
L~C
L~D
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c363t-d1330f5b2a7c376833a4f136182be5050ee21b3376aab0b1f8534d89577dab033
IEDL.DBID M7S
ISICitedReferencesCount 25
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000913617500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1382-3256
IngestDate Tue Dec 02 15:58:50 EST 2025
Sat Nov 29 05:37:46 EST 2025
Tue Nov 18 21:24:02 EST 2025
Fri Feb 21 02:43:30 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Configurable systems
Configuration counting
SAT
Benchmark
Model counting
Product lines
Feature models
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c363t-d1330f5b2a7c376833a4f136182be5050ee21b3376aab0b1f8534d89577dab033
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-5239-3307
OpenAccessLink https://link.springer.com/10.1007/s10664-022-10265-9
PQID 2765228104
PQPubID 326341
ParticipantIDs proquest_journals_2765228104
crossref_primary_10_1007_s10664_022_10265_9
crossref_citationtrail_10_1007_s10664_022_10265_9
springer_journals_10_1007_s10664_022_10265_9
PublicationCentury 2000
PublicationDate 2023-03-01
PublicationDateYYYYMMDD 2023-03-01
PublicationDate_xml – month: 03
  year: 2023
  text: 2023-03-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
– name: Dordrecht
PublicationSubtitle An International Journal
PublicationTitle Empirical software engineering : an international journal
PublicationTitleAbbrev Empir Software Eng
PublicationYear 2023
Publisher Springer US
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer Nature B.V
References Xu, Hutter, Hoos, Leyton-Brown (CR95) 2008; 32
CR39
Svahnberg, Bosch (CR89) 1999; 11
CR37
CR36
Le Berre, Parrain (CR57) 2010; 7
CR35
CR79
CR34
CR78
CR33
CR77
CR76
CR75
CR74
CR73
CR72
CR70
Biere (CR16) 2008; 4
Pérez Morago (CR71) 2016
CR2
CR4
CR3
Heradio-Gil, Fernández-Amorós, Cerrada, Cerrada (CR41) 2011; 5
CR8
CR9
CR49
CR48
Bagheri, Noia, Gasevic, Ragone (CR7) 2012; 24
CR47
CR46
Conover, Iman (CR24) 1981; 35
Toda, Soh (CR92) 2016; 21
Valiant (CR93) 1979; 8
CR44
CR88
CR43
CR87
Acher, Collet, Lahire, France (CR1) 2013; 78
CR42
CR85
CR40
CR83
Bagheri, Gasevic (CR6) 2011; 19
CR82
Zar (CR96) 1972; 67
CR81
CR80
Mendonça (CR60) 2009
Sullivan, Feinn (CR86) 2012; 4
Benavides, Segura, Ruiz-Cortés (CR11) 2010; 35
Heradio, Fernández-Amorós, Cerrada, Abad (CR38) 2013; 23
CR18
CR17
CR15
CR14
CR58
CR13
CR12
CR56
Sobernig, Apel, Kolesnikov, Siegmund (CR84) 2016; 21
CR55
CR10
CR54
CR53
CR52
CR51
CR50
CR94
Israeli, Feitelson (CR45) 2010; 83
Fichte, Hecher, Hamiti (CR32) 2021; 26
CR91
CR90
Darwiche (CR26) 2001; 11
CR29
CR28
CR27
Fernández-Amorós, Heradio, Cerrada, Cerrada (CR31) 2014; 40
Darwiche, Marquis (CR30) 2002; 17
CR25
CR69
CR68
CR23
Mendonca, Cowan (CR59) 2010; 75
CR67
CR22
CR66
CR21
CR65
Bryant (CR19) 1986; C-35
CR20
CR64
CR63
CR62
Artusi, Verderio, Marubini (CR5) 2002; 17
CR61
M Mendonça (10265_CR60) 2009
10265_CR74
10265_CR73
R Heradio (10265_CR38) 2013; 23
10265_CR76
HJ Pérez Morago (10265_CR71) 2016
10265_CR75
10265_CR34
10265_CR78
10265_CR33
10265_CR77
10265_CR36
10265_CR35
10265_CR79
10265_CR70
10265_CR72
E Bagheri (10265_CR6) 2011; 19
S Sobernig (10265_CR84) 2016; 21
10265_CR27
10265_CR29
10265_CR28
10265_CR63
10265_CR62
10265_CR21
10265_CR65
10265_CR20
10265_CR64
10265_CR23
10265_CR67
10265_CR22
10265_CR66
RE Bryant (10265_CR19) 1986; C-35
10265_CR25
10265_CR69
10265_CR68
10265_CR61
JH Zar (10265_CR96) 1972; 67
M Svahnberg (10265_CR89) 1999; 11
D Fernández-Amorós (10265_CR31) 2014; 40
10265_CR15
A Darwiche (10265_CR26) 2001; 11
10265_CR18
10265_CR17
D Le Berre (10265_CR57) 2010; 7
R Heradio-Gil (10265_CR41) 2011; 5
10265_CR52
10265_CR51
10265_CR10
10265_CR54
JK Fichte (10265_CR32) 2021; 26
10265_CR53
10265_CR12
10265_CR56
10265_CR55
10265_CR14
10265_CR58
10265_CR13
M Mendonca (10265_CR59) 2010; 75
A Biere (10265_CR16) 2008; 4
M Acher (10265_CR1) 2013; 78
10265_CR90
L Xu (10265_CR95) 2008; 32
D Benavides (10265_CR11) 2010; 35
10265_CR91
10265_CR50
10265_CR94
10265_CR3
10265_CR2
10265_CR9
10265_CR49
10265_CR8
10265_CR48
10265_CR4
LG Valiant (10265_CR93) 1979; 8
T Toda (10265_CR92) 2016; 21
E Bagheri (10265_CR7) 2012; 24
10265_CR85
10265_CR40
A Israeli (10265_CR45) 2010; 83
10265_CR43
10265_CR87
10265_CR42
10265_CR44
10265_CR88
10265_CR47
WJ Conover (10265_CR24) 1981; 35
10265_CR46
10265_CR81
10265_CR80
10265_CR83
10265_CR82
10265_CR37
10265_CR39
R Artusi (10265_CR5) 2002; 17
A Darwiche (10265_CR30) 2002; 17
GM Sullivan (10265_CR86) 2012; 4
References_xml – ident: CR70
– volume: 4
  start-page: 75
  year: 2008
  end-page: 97
  ident: CR16
  article-title: PicoSAT Essentials
  publication-title: J. Satisfiability Boolean Model Comput
  doi: 10.3233/SAT190039
– ident: CR22
– volume: 8
  start-page: 189
  issue: 2
  year: 1979
  end-page: 201
  ident: CR93
  article-title: The complexity of computing the permanent
  publication-title: Theor Comput Sci
  doi: 10.1016/0304-3975(79)90044-6
– volume: 78
  start-page: 657
  issue: 6
  year: 2013
  end-page: 681
  ident: CR1
  article-title: Familiar: a domain-specific language for large scale management of feature models
  publication-title: Sci Comput Program (SCP)
  doi: 10.1016/j.scico.2012.12.004
– ident: CR49
– ident: CR68
– ident: CR74
– ident: CR4
– ident: CR39
– ident: CR87
– ident: CR51
– ident: CR12
– ident: CR35
– volume: 4
  start-page: 279
  issue: 3
  year: 2012
  end-page: 282
  ident: CR86
  article-title: Using effect size—or why the P value is not enough
  publication-title: J Grad Med Educ
  doi: 10.4300/JGME-D-12-00156.1
– ident: CR29
– ident: CR54
– ident: CR61
– ident: CR80
– ident: CR77
– ident: CR8
– ident: CR58
– volume: 17
  start-page: 229
  issue: 1
  year: 2002
  end-page: 264
  ident: CR30
  article-title: A knowledge compilation map
  publication-title: J Artif Intell Res (JAIR)
  doi: 10.1613/jair.989
– year: 2016
  ident: CR71
  publication-title: BDD Algorithms to perform hard analysis operations on variability models
– ident: CR25
– ident: CR42
– volume: 75
  start-page: 311
  issue: 5
  year: 2010
  end-page: 332
  ident: CR59
  article-title: Decision-making coordination and efficient reasoning techniques for Feature-Based configuration
  publication-title: Sci Comput Program (SCP)
  doi: 10.1016/j.scico.2009.12.004
– ident: CR21
– ident: CR46
– ident: CR67
– ident: CR75
– ident: CR15
– ident: CR88
– ident: CR50
– ident: CR9
– volume: 21
  start-page: 1.12:1
  issue: 1
  year: 2016
  end-page: 1.12:44
  ident: CR92
  article-title: Implementing efficient all solutions SAT solvers
  publication-title: ACM J Exp Algorithmics (JEA)
– ident: CR36
– ident: CR78
– ident: CR85
– ident: CR81
– year: 2009
  ident: CR60
  publication-title: Efficient reasoning techniques for large scale feature models
– ident: CR64
– volume: 40
  start-page: 895
  issue: 9
  year: 2014
  end-page: 910
  ident: CR31
  article-title: A scalable approach to exact model and commonality counting for extended feature models
  publication-title: IEEE Trans Softw Eng (TSE)
  doi: 10.1109/TSE.2014.2331073
– volume: 19
  start-page: 579
  issue: 3
  year: 2011
  end-page: 612
  ident: CR6
  article-title: Assessing the maintainability of software product line feature models using structural metrics
  publication-title: Softw Qual J (SQJ)
  doi: 10.1007/s11219-010-9127-2
– volume: 21
  start-page: 1670
  issue: 4
  year: 2016
  end-page: 1705
  ident: CR84
  article-title: Quantifying structural attributes of system decompositions in 28 Feature-Oriented software product lines
  publication-title: Empir Softw Eng (EMSE)
  doi: 10.1007/s10664-014-9336-6
– volume: C-35
  start-page: 677
  issue: 8
  year: 1986
  end-page: 691
  ident: CR19
  article-title: Graph-Based Algorithms for boolean function manipulation
  publication-title: IEEE Trans Comput
  doi: 10.1109/TC.1986.1676819
– ident: CR18
– ident: CR43
– ident: CR66
– ident: CR91
– ident: CR47
– ident: CR72
– volume: 83
  start-page: 485
  issue: 3
  year: 2010
  end-page: 501
  ident: CR45
  article-title: The linux kernel as a case study in software evolution
  publication-title: J. Syst Softw (JSS)
  doi: 10.1016/j.jss.2009.09.042
– ident: CR14
– ident: CR2
– ident: CR37
– ident: CR53
– ident: CR10
– volume: 17
  start-page: 148
  issue: 2
  year: 2002
  end-page: 151
  ident: CR5
  article-title: Bravais-Pearson and spearman correlation coefficients: meaning, test of hypothesis and confidence interval
  publication-title: Int J Biol Markers (IJBM)
  doi: 10.1177/172460080201700213
– ident: CR33
– ident: CR82
– volume: 26
  start-page: 1
  year: 2021
  end-page: 26 , 13:1–26
  ident: CR32
  article-title: The model counting competition 2020
  publication-title: ACM J Exp Algorithmics (JEA)
  doi: 10.1145/3459080
– ident: CR79
– volume: 24
  start-page: 375
  issue: 4
  year: 2012
  end-page: 400
  ident: CR7
  article-title: Formalizing interactive staged feature model configuration
  publication-title: J Softw Evol Process
  doi: 10.1002/smr.534
– ident: CR56
– ident: CR40
– ident: CR63
– ident: CR27
– ident: CR23
– volume: 11
  start-page: 391
  issue: 6
  year: 1999
  end-page: 422
  ident: CR89
  article-title: Evolution in software product lines two cases
  publication-title: J Softw Maint (JSM)
  doi: 10.1002/(SICI)1096-908X(199911/12)11:6<391::AID-SMR199>3.0.CO;2-8
– ident: CR69
– ident: CR94
– ident: CR44
– ident: CR48
– ident: CR73
– ident: CR65
– ident: CR90
– volume: 35
  start-page: 615
  issue: 6
  year: 2010
  end-page: 708
  ident: CR11
  article-title: Automated analysis of feature models 20 years later a literature review
  publication-title: Inf Syst
  doi: 10.1016/j.is.2010.01.001
– ident: CR3
– volume: 35
  start-page: 124
  issue: 3
  year: 1981
  end-page: 129
  ident: CR24
  article-title: Rank transformations as a bridge between parametric and nonparametric statistics
  publication-title: Am Stat
– volume: 11
  start-page: 11
  issue: 1-2
  year: 2001
  end-page: 34
  ident: CR26
  article-title: On the tractable counting of theory models and its application to truth maintenance and belief revision
  publication-title: J Appl Non-Class Logics
  doi: 10.3166/jancl.11.11-34
– ident: CR52
– ident: CR17
– volume: 5
  start-page: 496
  issue: 6
  year: 2011
  end-page: 509
  ident: CR41
  article-title: Supporting commonality-based analysis of software product lines
  publication-title: IET Softw
  doi: 10.1049/iet-sen.2010.0022
– volume: 7
  start-page: 59
  issue: 2-3
  year: 2010
  end-page: 64
  ident: CR57
  article-title: The sat4j library, release 2.2
  publication-title: J Satisfiability Boolean Model Comput
  doi: 10.3233/SAT190075
– volume: 67
  start-page: 578
  issue: 339
  year: 1972
  end-page: 580
  ident: CR96
  article-title: Significance testing of the spearman rank correlation coefficient
  publication-title: J Am Stat Assoc
  doi: 10.1080/01621459.1972.10481251
– ident: CR13
– ident: CR34
– ident: CR55
– ident: CR76
– ident: CR83
– volume: 32
  start-page: 565
  year: 2008
  end-page: 606
  ident: CR95
  article-title: SATzilla: portfolio-based algorithm selection for SAT
  publication-title: J Artif Intell Res (JAIR)
  doi: 10.1613/jair.2490
– ident: CR28
– ident: CR62
– ident: CR20
– volume: 23
  start-page: 1177
  issue: 08
  year: 2013
  end-page: 1204
  ident: CR38
  article-title: A literature review on feature diagram product counting and its usage in software product line economic models
  publication-title: Int J Softw Eng Knowl Eng (IJSEKE)
  doi: 10.1142/S0218194013500368
– ident: 10265_CR27
– ident: 10265_CR46
  doi: 10.1109/SPLINE.2007.12
– ident: 10265_CR81
– ident: 10265_CR51
  doi: 10.1145/3093335.2993248
– ident: 10265_CR74
  doi: 10.1145/3336294.3336322
– volume: 40
  start-page: 895
  issue: 9
  year: 2014
  ident: 10265_CR31
  publication-title: IEEE Trans Softw Eng (TSE)
  doi: 10.1109/TSE.2014.2331073
– ident: 10265_CR34
  doi: 10.1145/3382025.3414946
– ident: 10265_CR10
– ident: 10265_CR25
  doi: 10.1109/SPLINE.2007.24
– volume: 83
  start-page: 485
  issue: 3
  year: 2010
  ident: 10265_CR45
  publication-title: J. Syst Softw (JSS)
  doi: 10.1016/j.jss.2009.09.042
– volume: 35
  start-page: 124
  issue: 3
  year: 1981
  ident: 10265_CR24
  publication-title: Am Stat
  doi: 10.1080/00031305.1981.10479327
– ident: 10265_CR69
  doi: 10.1007/978-3-319-10428-7_7
– ident: 10265_CR14
– ident: 10265_CR22
  doi: 10.1007/978-3-642-40627-0_18
– volume: 32
  start-page: 565
  year: 2008
  ident: 10265_CR95
  publication-title: J Artif Intell Res (JAIR)
  doi: 10.1613/jair.2490
– ident: 10265_CR37
– volume: 19
  start-page: 579
  issue: 3
  year: 2011
  ident: 10265_CR6
  publication-title: Softw Qual J (SQJ)
  doi: 10.1007/s11219-010-9127-2
– volume-title: BDD Algorithms to perform hard analysis operations on variability models
  year: 2016
  ident: 10265_CR71
– ident: 10265_CR94
  doi: 10.1007/11499107_24
– ident: 10265_CR77
  doi: 10.1109/ICCAD.1993.580029
– ident: 10265_CR9
  doi: 10.1007/11554844_3
– ident: 10265_CR91
  doi: 10.1007/11814948_38
– ident: 10265_CR54
  doi: 10.4204/EPTCS.29.5
– ident: 10265_CR72
  doi: 10.1109/ICST.2010.43
– volume: 23
  start-page: 1177
  issue: 08
  year: 2013
  ident: 10265_CR38
  publication-title: Int J Softw Eng Knowl Eng (IJSEKE)
  doi: 10.1142/S0218194013500368
– volume: 17
  start-page: 229
  issue: 1
  year: 2002
  ident: 10265_CR30
  publication-title: J Artif Intell Res (JAIR)
  doi: 10.1613/jair.989
– ident: 10265_CR21
  doi: 10.1007/978-3-319-24318-4_5
– ident: 10265_CR28
– volume: 5
  start-page: 496
  issue: 6
  year: 2011
  ident: 10265_CR41
  publication-title: IET Softw
  doi: 10.1049/iet-sen.2010.0022
– ident: 10265_CR82
– volume: 78
  start-page: 657
  issue: 6
  year: 2013
  ident: 10265_CR1
  publication-title: Sci Comput Program (SCP)
  doi: 10.1016/j.scico.2012.12.004
– volume: C-35
  start-page: 677
  issue: 8
  year: 1986
  ident: 10265_CR19
  publication-title: IEEE Trans Comput
  doi: 10.1109/TC.1986.1676819
– ident: 10265_CR33
  doi: 10.1007/978-3-030-30048-7_29
– ident: 10265_CR80
  doi: 10.1145/2884781.2884823
– ident: 10265_CR48
  doi: 10.1007/978-3-642-40196-1_16
– ident: 10265_CR85
  doi: 10.1145/3377024.3377036
– volume: 21
  start-page: 1.12:1
  issue: 1
  year: 2016
  ident: 10265_CR92
  publication-title: ACM J Exp Algorithmics (JEA)
– ident: 10265_CR13
– volume: 21
  start-page: 1670
  issue: 4
  year: 2016
  ident: 10265_CR84
  publication-title: Empir Softw Eng (EMSE)
  doi: 10.1007/s10664-014-9336-6
– ident: 10265_CR17
– ident: 10265_CR66
– volume: 67
  start-page: 578
  issue: 339
  year: 1972
  ident: 10265_CR96
  publication-title: J Am Stat Assoc
  doi: 10.1080/01621459.1972.10481251
– ident: 10265_CR62
– ident: 10265_CR52
  doi: 10.1145/3109729.3109751
– ident: 10265_CR61
  doi: 10.1145/1639950.1640002
– ident: 10265_CR49
  doi: 10.1145/3106237.3106252
– volume: 11
  start-page: 391
  issue: 6
  year: 1999
  ident: 10265_CR89
  publication-title: J Softw Maint (JSM)
  doi: 10.1002/(SICI)1096-908X(199911/12)11:6<391::AID-SMR199>3.0.CO;2-8
– ident: 10265_CR83
  doi: 10.24963/ijcai.2019/163
– ident: 10265_CR50
– ident: 10265_CR88
  doi: 10.1145/3377024.3377025
– ident: 10265_CR29
– ident: 10265_CR56
  doi: 10.24963/ijcai.2018/185
– ident: 10265_CR35
  doi: 10.1145/2934466.2934478
– ident: 10265_CR87
  doi: 10.1145/3442391.3442404
– volume: 8
  start-page: 189
  issue: 2
  year: 1979
  ident: 10265_CR93
  publication-title: Theor Comput Sci
  doi: 10.1016/0304-3975(79)90044-6
– volume: 35
  start-page: 615
  issue: 6
  year: 2010
  ident: 10265_CR11
  publication-title: Inf Syst
  doi: 10.1016/j.is.2010.01.001
– volume: 24
  start-page: 375
  issue: 4
  year: 2012
  ident: 10265_CR7
  publication-title: J Softw Evol Process
  doi: 10.1002/smr.534
– ident: 10265_CR65
  doi: 10.1145/3278122.3278123
– ident: 10265_CR79
  doi: 10.1007/11499107_17
– ident: 10265_CR3
  doi: 10.1007/978-3-642-04244-7_13
– ident: 10265_CR44
  doi: 10.1017/CBO9780511810275
– ident: 10265_CR64
  doi: 10.1145/3336294.3336297
– ident: 10265_CR40
– ident: 10265_CR75
  doi: 10.1109/ICST.2019.00032
– volume: 75
  start-page: 311
  issue: 5
  year: 2010
  ident: 10265_CR59
  publication-title: Sci Comput Program (SCP)
  doi: 10.1016/j.scico.2009.12.004
– ident: 10265_CR63
– volume: 4
  start-page: 279
  issue: 3
  year: 2012
  ident: 10265_CR86
  publication-title: J Grad Med Educ
  doi: 10.4300/JGME-D-12-00156.1
– ident: 10265_CR42
  doi: 10.1145/3461001.3474452
– volume: 17
  start-page: 148
  issue: 2
  year: 2002
  ident: 10265_CR5
  publication-title: Int J Biol Markers (IJBM)
  doi: 10.1177/172460080201700213
– volume: 7
  start-page: 59
  issue: 2-3
  year: 2010
  ident: 10265_CR57
  publication-title: J Satisfiability Boolean Model Comput
  doi: 10.3233/SAT190075
– ident: 10265_CR58
  doi: 10.1002/9780470479216.corpsy0524
– volume: 11
  start-page: 11
  issue: 1-2
  year: 2001
  ident: 10265_CR26
  publication-title: J Appl Non-Class Logics
  doi: 10.3166/jancl.11.11-34
– volume-title: Efficient reasoning techniques for large scale feature models
  year: 2009
  ident: 10265_CR60
– ident: 10265_CR78
– ident: 10265_CR15
  doi: 10.1007/978-3-319-14130-5_20
– ident: 10265_CR18
  doi: 10.1007/3-540-47833-7_3
– ident: 10265_CR55
  doi: 10.24963/ijcai.2017/93
– ident: 10265_CR8
  doi: 10.1145/3368089.3409744
– ident: 10265_CR70
– ident: 10265_CR68
– ident: 10265_CR73
  doi: 10.1145/3442391.3442410
– ident: 10265_CR12
  doi: 10.1007/11877028_16
– ident: 10265_CR67
  doi: 10.1145/3106237.3106273
– volume: 4
  start-page: 75
  year: 2008
  ident: 10265_CR16
  publication-title: J. Satisfiability Boolean Model Comput
  doi: 10.3233/SAT190039
– ident: 10265_CR90
  doi: 10.1109/SPLC.2011.53
– ident: 10265_CR53
  doi: 10.1145/3180155.3180159
– ident: 10265_CR36
– ident: 10265_CR43
– ident: 10265_CR76
  doi: 10.1109/ASE.2011.6100068
– ident: 10265_CR4
  doi: 10.1007/978-3-642-37521-7
– ident: 10265_CR23
  doi: 10.1109/SPLC.2011.47
– volume: 26
  start-page: 1
  year: 2021
  ident: 10265_CR32
  publication-title: ACM J Exp Algorithmics (JEA)
  doi: 10.1145/3459080
– ident: 10265_CR47
  doi: 10.1109/ICSE.2009.5070568
– ident: 10265_CR2
  doi: 10.1145/3001867.3001870
– ident: 10265_CR39
  doi: 10.1109/ICSE.2019.00091
– ident: 10265_CR20
  doi: 10.1007/978-3-319-10575-8_7
SSID ssj0009745
Score 2.4835954
Snippet Product lines are widely used to manage families of products that share a common base of features. Typically, not every combination (configuration) of features...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 29
SubjectTerms Compilers
Complex systems
Computation
Computer Science
Configurations
Design of experiments
Interpreters
Product lines
Programming Languages
Software Engineering/Programming and Operating Systems
Software Product Lines and Variability-rich Systems (SPLC)
Solvers
State-of-the-art reviews
SummonAdditionalLinks – databaseName: Springer Nature - Connect here FIRST to enable access
  dbid: RSV
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3LS8MwGA86PXhxPnE6JaA3DaxNm8dxyIYHGeKm7FaSNhkD6WQP_36_tOmqooJemwfly_fke_wQugpioyzPQiK1VCSyKiOaWUEo60gIglIleFqATfDBQIzH8sE3hS2qavcqJVlo6g_NboxFxFWfg1FkMZGbaAvMnXDi-Dh8rkft8gKa2A3XIxQsum-V-f6Oz-ao9jG_pEULa9Nv_u8_99Cu9y5xt2SHfbRh8gPUrJAbsBfkQ3Tf80O-8wkuWorIzBJwBV2dHL7Ew-4IA0-6ig08y_F0De-BIXq208mqZBsM2gjUzBF66vdGt3fE4yqQlDK6JBnEpR0b61DxFPSLoFRFNqAMQg1twCPqGBMGmsKSUrqjAwsmPcqEjDnP4AOlx6iRz3JzgrAU0mRGKPB6dSRirmkYKJkplzWIuDUtFFTkTVI_dNxhX7wk9bhkR64EyJUU5EpkC12vz7yWIzd-3d2uXi3x4rdIQs7ArxQQarbQTfVK9fLPt53-bfsZ2nHw82VNWhs1lvOVOUfb6dtyuphfFGz5Dk_Z2fg
  priority: 102
  providerName: Springer Nature
Title Evaluating state-of-the-art # SAT solvers on industrial configuration spaces
URI https://link.springer.com/article/10.1007/s10664-022-10265-9
https://www.proquest.com/docview/2765228104
Volume 28
WOSCitedRecordID wos000913617500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: Springer Nature - Connect here FIRST to enable access
  customDbUrl:
  eissn: 1573-7616
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009745
  issn: 1382-3256
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NS8MwFH_o5sGL8xPnxwjoTYNr0zbJSVQ2PMgYm4p4KUmbyEA6ddO_35cutSjoxUsOTRtK3sv7SF5-P4DjIDbK8jykUktFI6tyqhMrKEu6EpOgTAmelWQTfDAQDw9y6DfcZr6ssrKJpaHOp5nbIz8LeYKhgsDs4fzllTrWKHe66ik0lqHpUBLCsnRvXIPu8pKk2MHsUYa-3V-a8VfnkiSirpYdXWwSU_ndMdXR5o8D0tLv9Fv__eN1WPMRJ7lYqMgGLJliE1oVmwPxi3sLbnoe-Lt4IuU1Izq1FMNDVztHjsj44pagnroqDjItyOSL8oNgRm0nT-8LVSJoodD0bMNdv3d7dU091wLNWMLmNMdctWtjHSqeoc0RjKnIBizB9EMbjJK6xoSBZtillO7qwKKbj3IhY85zfMDYDjSKaWF2gUghTW6EwkhYRyLmmoWBkrlyJwkRt6YNQTXRaeaByB0fxnNaQyg74aQonLQUTirbcPL1zcsChuPPtw8qiaR-Sc7SWhxtOK1kWnf_Ptre36Ptw6qjoF_UpR1AY_72bg5hJfuYT2ZvHWhe9gbDUadUTGyH8SO2o_H9J67556k
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3fa9swED5COlhf2q5badZ0E3R72kRjy7akh1LClpDSLAySQd9cyZZKoNhpkm7sn9rfuJN_xGywvPVhr5YtsHX33Sfr7j6Ad15olOWpT6WWigZWpVRHVlAW9SRughIleFKITfDJRNzcyK8t-FXXwri0yhoTC6BO88T9Iz_3eYRUQeDu4XLxQJ1qlDtdrSU0SrO4Nj9_4JZtdXH1Gdf3ve8PB7NPI1qpCtCERWxNU9yV9WyofcUT9C7BmAqsxyIk2togH-gZ43ua4ZBSuqc9iwEtSIUMOU_xgvsBipC_Ezj0L1IFp02TX16IIru2fpQhl6iKdKpSvSgKqMudx5AehVT-GQgbdvvXgWwR54b7_9sXOoC9ilGTfukCL6BlskPYr9UqSAVeL2E8qBqbZ3ekKKOiuaVIf11uIDkj0_6MoB-6LBWSZ2S-kTQhSZ7Z-d1j6SoEERih9RV8e5J3OoJ2lmfmGIgU0qRGKGT6OhAh18z3lEyVOykJuDUd8OqFjZOq0brT-7iPmxbRzhhiNIa4MIZYduDD5plF2WZk693d2gLiCnJWcbP8HfhY21Az_O_ZXm-f7S08H82-jOPx1eT6BHZ9JHllDl4X2uvlozmFZ8n39Xy1fFM4A4Hbp7at36S_Ppg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3fS-QwEB5ERe7FH-cdrj8D5z15wW3TNsmDiKiLoiwLKsi99JI2kQVp1V0V_zX_OidtajlB33zwtWkDbb6ZfNPMzAewGcRGWZ6HVGqpaGRVTnViBWVJV2IQlCnBs0psgvf74vJSDibguamFcWmVjU-sHHVeZu4f-XbIE6QKAqOHbevTIgYHvd2bW-oUpNxJayOnUUPkxDw9Yvg22jk-wLX-HYa9w_P9I-oVBmjGEjamOUZoXRvrUPEMLU0wpiIbsARJtzbIDbrGhIFmOKSU7urA4uYW5ULGnOd4wf0MRfc_xTHGdIHfIP7bNvzllUCya_FHGfIKX7Djy_aSJKIujx639ySm8v9NsWW6bw5nqz2vN_eVv9Y8zHqmTfZq01iACVN8h7lGxYJ4p7YIp4e-4XlxRaryKlpairTY5QySX-Rs75ygfbrsFVIWZPgqdUKysrDDq_vahAh6ZnS5P-DiU97pJ0wWZWGWgEghTW6EwghARyLmmoWBkrlyJygRt6YDQbPIaeYbsDsdkOu0bR3tgJEiMNIKGKnswNbrMzd1-5EP715t0JB6VzRKWyh04E-Dp3b4_dmWP55tA2YQUunpcf9kBb6FyP3q1LxVmBzf3Zs1mM4exsPR3XplFwT-fTa0XgC9Dkd7
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Evaluating+state-of-the-art+%23+SAT+solvers+on+industrial+configuration+spaces&rft.jtitle=Empirical+software+engineering+%3A+an+international+journal&rft.au=Sundermann%2C+Chico&rft.au=He%C3%9F%2C+Tobias&rft.au=Nieke%2C+Michael&rft.au=Bittner%2C+Paul+Maximilian&rft.date=2023-03-01&rft.issn=1382-3256&rft.eissn=1573-7616&rft.volume=28&rft.issue=2&rft_id=info:doi/10.1007%2Fs10664-022-10265-9&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10664_022_10265_9
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1382-3256&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1382-3256&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1382-3256&client=summon