{"id":"https://openalex.org/W4399381916","doi":"https://doi.org/10.1145/3644033.3644371","title":"Preprocessing is What You Need: Understanding and Predicting the Complexity of SAT-based Uniform Random Sampling","display_name":"Preprocessing is What You Need: Understanding and Predicting the Complexity of SAT-based Uniform Random Sampling","publication_year":2024,"publication_date":"2024-04-14","ids":{"openalex":"https://openalex.org/W4399381916","doi":"https://doi.org/10.1145/3644033.3644371"},"language":"en","primary_location":{"id":"doi:10.1145/3644033.3644371","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3644033.3644371","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3644033.3644371","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3644033.3644371","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080393412","display_name":"Olivier Zeyen","orcid":"https://orcid.org/0000-0003-0378-5643"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":true,"raw_author_name":"Olivier Zeyen","raw_affiliation_strings":["University of Luxembourg, SnT, Luxembourg, Luxembourg"],"affiliations":[{"raw_affiliation_string":"University of Luxembourg, SnT, Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000695937","display_name":"Maxime Cordy","orcid":"https://orcid.org/0000-0001-8312-1358"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"Maxime Cordy","raw_affiliation_strings":["SnT, University of Luxembourg, Luxembourg, Luxembourg"],"affiliations":[{"raw_affiliation_string":"SnT, University of Luxembourg, Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055104897","display_name":"Gilles Perrouin","orcid":"https://orcid.org/0000-0002-8431-0377"},"institutions":[{"id":"https://openalex.org/I149768937","display_name":"University of Namur","ror":"https://ror.org/03d1maw17","country_code":"BE","type":"education","lineage":["https://openalex.org/I149768937"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Gilles Perrouin","raw_affiliation_strings":["Universit\u00e9 de Namur, Namur, Belgium"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Namur, Namur, Belgium","institution_ids":["https://openalex.org/I149768937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003973216","display_name":"Mathieu Acher","orcid":"https://orcid.org/0000-0003-1483-3858"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I2802519937","display_name":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires","ror":"https://ror.org/00myn0z94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I205703379","https://openalex.org/I2802204017","https://openalex.org/I2802519937","https://openalex.org/I28221208","https://openalex.org/I4210127572","https://openalex.org/I4210159245","https://openalex.org/I56067802"]},{"id":"https://openalex.org/I56067802","display_name":"Universit\u00e9 de Rennes","ror":"https://ror.org/015m7wh34","country_code":"FR","type":"education","lineage":["https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mathieu Acher","raw_affiliation_strings":["Univ Rennes, Inria, CNRS, IRISA, Rennes, France"],"affiliations":[{"raw_affiliation_string":"Univ Rennes, Inria, CNRS, IRISA, Rennes, France","institution_ids":["https://openalex.org/I2802519937","https://openalex.org/I56067802","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5080393412"],"corresponding_institution_ids":["https://openalex.org/I186903577"],"apc_list":null,"apc_paid":null,"fwci":0.6813,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73568615,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"23","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10639","display_name":"Advanced Software Engineering Methodologies","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10639","display_name":"Advanced Software Engineering Methodologies","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12127","display_name":"Software System Performance and Reliability","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5962930917739868},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.5812028050422668},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5094888806343079},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.49088674783706665},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.46658140420913696},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.444504976272583},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.4305887520313263},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4225376844406128},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.42082875967025757},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.41312912106513977},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3665377199649811},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36324644088745117},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2518923878669739},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21102914214134216}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5962930917739868},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.5812028050422668},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5094888806343079},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.49088674783706665},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.46658140420913696},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.444504976272583},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4305887520313263},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4225376844406128},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.42082875967025757},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.41312912106513977},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3665377199649811},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36324644088745117},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2518923878669739},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21102914214134216},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3644033.3644371","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3644033.3644371","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3644033.3644371","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.unamur.be:openaire_cris_publications/2de20a1d-ec5c-4b8a-a6cd-a200315bbab7","is_oa":true,"landing_page_url":"https://researchportal.unamur.be/en/publications/2de20a1d-ec5c-4b8a-a6cd-a200315bbab7","pdf_url":null,"source":{"id":"https://openalex.org/S4406922457","display_name":"Repository of the University of Namur","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zeyen, O, Cordy, M, Perrouin, G & Acher, M 2024, 'Preprocessing is What You Need: Understanding and Predicting the Complexity of SAT-based Uniform Random Sampling', Paper presented at 12 International Conference On Formal Methods In Software Engineering, Lisbon, Portugal, 14/04/24 - 15/04/24 pp. 23-32. https://doi.org/10.1145/3644033.3644371","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:orbilu.uni.lu:10993/61583","is_oa":true,"landing_page_url":"https://orbilu.uni.lu/handle/10993/61583","pdf_url":"https://orbilu.uni.lu/bitstream/10993/61583/1/FormaliSE2024_UnderstandingSATScalability-2.pdf","source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings - 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering, FormaliSE 2024 (2024-04-14); Proceedings of the 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE), Lisbon, Prt [Prt], 14-04-2024 => 15-04-2024","raw_type":"peer reviewed"},{"id":"pmh:oai:pure.unamur.be:openaire/2de20a1d-ec5c-4b8a-a6cd-a200315bbab7","is_oa":true,"landing_page_url":"https://researchportal.unamur.be/files/92372580/Vamos2024_UnderstandingSATScalability-Author-Version.pdf","pdf_url":"https://pure.unamur.be/ws/files/92372580/Vamos2024_UnderstandingSATScalability-Author-Version.pdf","source":{"id":"https://openalex.org/S4406922457","display_name":"Repository of the University of Namur","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Zeyen, O, Cordy, M, Perrouin, G & Acher, M 2024, 'Preprocessing is What You Need: Understanding and Predicting the Complexity of SAT-based Uniform Random Sampling', Paper presented at 12 International Conference On Formal Methods In Software Engineering, Lisbon, Portugal, 14/04/24 - 15/04/24 pp. 23-32. https://doi.org/10.1145/3644033.3644371","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/3644033.3644371","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3644033.3644371","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3644033.3644371","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE)","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6653108018","display_name":null,"funder_award_id":"C19/IS/13566661/BEEHIVE/Cordy","funder_id":"https://openalex.org/F4320321038","funder_display_name":"Fonds National de la Recherche Luxembourg"}],"funders":[{"id":"https://openalex.org/F4320321038","display_name":"Fonds National de la Recherche Luxembourg","ror":"https://ror.org/039z13y21"},{"id":"https://openalex.org/F4320321390","display_name":"Fonds De La Recherche Scientifique - FNRS","ror":"https://ror.org/03q83t159"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399381916.pdf","grobid_xml":"https://content.openalex.org/works/W4399381916.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W89760577","https://openalex.org/W1537730723","https://openalex.org/W1978222018","https://openalex.org/W2040767332","https://openalex.org/W2082677523","https://openalex.org/W2099213660","https://openalex.org/W2125853721","https://openalex.org/W2149902097","https://openalex.org/W2236948976","https://openalex.org/W2740402962","https://openalex.org/W2741061345","https://openalex.org/W2741942913","https://openalex.org/W2790553629","https://openalex.org/W2793051425","https://openalex.org/W2794800068","https://openalex.org/W2794846473","https://openalex.org/W2810413193","https://openalex.org/W2900560989","https://openalex.org/W2941640074","https://openalex.org/W2997591727","https://openalex.org/W3005807947","https://openalex.org/W3019051048","https://openalex.org/W3183515694","https://openalex.org/W4220886077","https://openalex.org/W6687446400"],"related_works":["https://openalex.org/W3136261533","https://openalex.org/W3120153087","https://openalex.org/W2235115558","https://openalex.org/W2014111643","https://openalex.org/W3107131366","https://openalex.org/W2127594621","https://openalex.org/W3128448798","https://openalex.org/W333184999","https://openalex.org/W1600869845","https://openalex.org/W1608133301"],"abstract_inverted_index":{"Despite":[0],"its":[1,214],"NP-completeness,":[2],"the":[3,39,43,80,87,116,134,146,176,204,249],"Boolean":[4,21,27],"satisfiability":[5],"problem":[6],"gave":[7],"birth":[8],"to":[9,16,19,53,60,160,171,189,230,247],"highly":[10,187],"efficient":[11,168,226],"tools":[12,119],"that":[13,183],"are":[14,49,158],"able":[15],"find":[17],"solutions":[18,64],"a":[20,62,142,173,235,240],"formula":[22,143,207,237],"and":[23,97,99,105,121,138,181,191,198,212,251,257],"compute":[24,161,172],"their":[25,111],"number.":[26],"formulae":[28],"compactly":[29],"encode":[30],"huge,":[31],"constrained":[32],"search":[33,47],"spaces":[34,48],"for":[35],"variability-intensive":[36],"systems,":[37],"e.g.,":[38],"possible":[40],"configurations":[41],"of":[42,71,89,136,178,194,206],"Linux":[44],"kernel.":[45],"These":[46],"generally":[50],"too":[51],"big":[52],"explore":[54,203],"exhaustively,":[55],"leading":[56],"most":[57],"testing":[58],"approaches":[59],"sample":[61],"few":[63],"before":[65],"analysing":[66],"them.":[67],"A":[68],"desirable":[69],"property":[70,85],"such":[72,132,152],"samples":[73],"is":[74,125,186],"uniformity:":[75],"each":[76],"solution":[77],"should":[78],"get":[79],"same":[81],"selection":[82],"probability.":[83],"This":[84],"motivated":[86],"design":[88],"uniform":[90,195],"random":[91,196],"samplers,":[92],"relying":[93],"on":[94,162,209,217,220],"SAT":[95],"solvers":[96],"counters":[98],"achieving":[100],"different":[101],"tradeoffs":[102],"between":[103,253],"uniformity":[104],"scalability.":[106],"Though":[107],"we":[108,223],"can":[109],"observe":[110],"performance":[112],"in":[113,141],"practice,":[114],"understanding":[115],"complexity":[117],"these":[118,221],"face":[120],"accurately":[122],"predicting":[123],"it":[124],"an":[126,167,225],"under-explored":[127],"problem.":[128],"Indeed,":[129],"structural":[130],"metrics":[131,211],"as":[133,153],"number":[135,177],"variables":[137],"clauses":[139],"involved":[140],"poorly":[144],"predict":[145,231],"sampling":[147,197,234],"complexity.":[148],"More":[149],"elaborated":[150],"ones,":[151],"minimal":[154],"independent":[155],"support":[156],"(MIS),":[157],"intractable":[159],"large":[163],"formulae.":[164],"We":[165,202],"provide":[166],"parallel":[169],"algorithm":[170],"related":[174],"metric,":[175],"equivalence":[179],"classes,":[180],"demonstrate":[182],"this":[184],"metric":[185],"correlated":[188],"time":[190],"memory":[192],"usage":[193],"model":[199],"counting":[200],"tools.":[201],"role":[205],"preprocessing":[208],"various":[210],"show":[213],"positive":[215],"influence":[216],"correlations.":[218],"Relying":[219],"correlations,":[222],"train":[224],"classifier":[227],"(F1-score":[228],"0.97)":[229],"whether":[232],"uniformly":[233],"given":[236],"will":[238],"exceed":[239],"specified":[241],"budget.":[242],"Our":[243],"results":[244],"allow":[245],"us":[246],"characterise":[248],"similarities":[250],"differences":[252],"(uniform)":[254],"sampling,":[255],"solving":[256],"counting.":[258]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}