{"id":"https://openalex.org/W4200024925","doi":"https://doi.org/10.1007/s00165-021-00563-2","title":"Statistical model checking for variability-intensive systems: applications to bug detection and minimization","display_name":"Statistical model checking for variability-intensive systems: applications to bug detection and minimization","publication_year":2021,"publication_date":"2021-12-01","ids":{"openalex":"https://openalex.org/W4200024925","doi":"https://doi.org/10.1007/s00165-021-00563-2"},"language":"en","primary_location":{"id":"doi:10.1007/s00165-021-00563-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-021-00563-2","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-021-00563-2","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-021-00563-2","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Maxime Cordy","raw_affiliation_strings":["SnT, University of Luxembourg, Esch-sur-Alzette, Luxembourg"],"affiliations":[{"raw_affiliation_string":"SnT, University of Luxembourg, Esch-sur-Alzette, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030367248","display_name":"Sami Lazreg","orcid":null},"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":"Sami Lazreg","raw_affiliation_strings":["SnT, University of Luxembourg, Esch-sur-Alzette, Luxembourg"],"affiliations":[{"raw_affiliation_string":"SnT, University of Luxembourg, Esch-sur-Alzette, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081145634","display_name":"Mike Papadakis","orcid":"https://orcid.org/0000-0003-1852-2547"},"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":"Mike Papadakis","raw_affiliation_strings":["SnT, University of Luxembourg, Esch-sur-Alzette, Luxembourg"],"affiliations":[{"raw_affiliation_string":"SnT, University of Luxembourg, Esch-sur-Alzette, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030129842","display_name":"Axel Legay","orcid":"https://orcid.org/0000-0003-2287-8925"},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Axel Legay","raw_affiliation_strings":["Universit\u00e9 Catholique de Louvain, Ottignies-Louvain-la-Neuve, Belgium"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Catholique de Louvain, Ottignies-Louvain-la-Neuve, Belgium","institution_ids":["https://openalex.org/I95674353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5000695937"],"corresponding_institution_ids":["https://openalex.org/I186903577"],"apc_list":null,"apc_paid":null,"fwci":0.4439,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.68689502,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"33","issue":"6","first_page":"1147","last_page":"1172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9987000226974487,"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/T10639","display_name":"Advanced Software Engineering Methodologies","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7569182515144348},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6161636114120483},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5619022846221924},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5527603626251221},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4958554208278656},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.4931713938713074},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.448355495929718},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.44344672560691833},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4343298375606537},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4312559962272644},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1834735870361328},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11589965224266052}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7569182515144348},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6161636114120483},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5619022846221924},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5527603626251221},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4958554208278656},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.4931713938713074},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.448355495929718},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.44344672560691833},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4343298375606537},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4312559962272644},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1834735870361328},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11589965224266052},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00165-021-00563-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-021-00563-2","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-021-00563-2","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},{"id":"pmh:oai:orbilu.uni.lu:10993/49668","is_oa":true,"landing_page_url":"http://orbilu.uni.lu/handle/10993/49668","pdf_url":null,"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-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Formal Aspects of Computing, 33 (6), 1147--1172 (2021)","raw_type":"peer reviewed"}],"best_oa_location":{"id":"doi:10.1007/s00165-021-00563-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-021-00563-2","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-021-00563-2","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5799999833106995,"display_name":"Peace, Justice and strong institutions"}],"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"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4200024925.pdf","grobid_xml":"https://content.openalex.org/works/W4200024925.grobid-xml"},"referenced_works_count":46,"referenced_works":["https://openalex.org/W81140875","https://openalex.org/W1489725951","https://openalex.org/W1509343160","https://openalex.org/W1631091010","https://openalex.org/W1748853391","https://openalex.org/W1783413852","https://openalex.org/W1794159487","https://openalex.org/W1935856783","https://openalex.org/W1963894531","https://openalex.org/W1968560832","https://openalex.org/W1987519845","https://openalex.org/W1998265601","https://openalex.org/W2013108033","https://openalex.org/W2014938705","https://openalex.org/W2016299540","https://openalex.org/W2020893644","https://openalex.org/W2023808162","https://openalex.org/W2034102118","https://openalex.org/W2048064553","https://openalex.org/W2068847249","https://openalex.org/W2071109087","https://openalex.org/W2083099046","https://openalex.org/W2089295423","https://openalex.org/W2097462212","https://openalex.org/W2099213660","https://openalex.org/W2110025251","https://openalex.org/W2120119918","https://openalex.org/W2128967738","https://openalex.org/W2148974547","https://openalex.org/W2219042429","https://openalex.org/W2239654746","https://openalex.org/W2555395830","https://openalex.org/W2808965408","https://openalex.org/W2898837242","https://openalex.org/W2941640074","https://openalex.org/W2953843994","https://openalex.org/W2953999399","https://openalex.org/W2954839330","https://openalex.org/W2962858291","https://openalex.org/W2967034934","https://openalex.org/W2967185606","https://openalex.org/W3012157709","https://openalex.org/W4230126391","https://openalex.org/W4237946187","https://openalex.org/W4246103079","https://openalex.org/W4256135941"],"related_works":["https://openalex.org/W2046228374","https://openalex.org/W1572578464","https://openalex.org/W2158144798","https://openalex.org/W2804745155","https://openalex.org/W2736259393","https://openalex.org/W2529542719","https://openalex.org/W2182066955","https://openalex.org/W2162351207","https://openalex.org/W2952737788","https://openalex.org/W2493800215"],"abstract_inverted_index":{"Abstract":[0],"We":[1,78,127,161,285],"propose":[2,44,269],"a":[3,99,108,163,215,270,293],"new":[4,64],"Statistical":[5],"Model":[6],"Checking":[7],"(SMC)":[8],"method":[9,131,197,218,273],"to":[10,45,134,140,144,175,177,199,219,245],"identify":[11,221,256],"bugs":[12,136],"in":[13,24,82,103,119,250],"variability-intensive":[14],"systems":[15,21,51],"(VIS).":[16],"The":[17,87,227],"state-space":[18],"of":[19,27,60,69,93,157,173,182,205,224,263],"such":[20],"is":[22],"exponential":[23],"the":[25,31,57,67,91,120,155,171,179,206,222,231,236,257,261,301],"number":[26,172],"variants,":[28],"which":[29],"makes":[30],"verification":[32,41],"problem":[33,92],"harder":[34],"than":[35,147],"for":[36,170],"classical":[37],"systems.":[38],"To":[39,112],"reduce":[40],"time,":[42],"we":[43,115,268],"combine":[46],"SMC":[47,211,272],"with":[48,297],"featured":[49,121],"transition":[50,122],"(FTS)\u2014a":[52],"model":[53],"that":[54,97,129,195,210,240,259,274,292],"represents":[55],"jointly":[56],"state":[58],"spaces":[59],"all":[61,95,201,251],"variants.":[62,77,226],"Our":[63,184],"methods":[65],"allow":[66],"sampling":[68],"executions":[70],"from":[71],"one":[72,254],"or":[73],"more":[74],"(potentially":[75],"all)":[76],"investigate":[79],"their":[80,252,282],"utility":[81],"two":[83],"complementary":[84],"use":[85],"cases.":[86],"first":[88,232],"case":[89,192,229,235],"considers":[90],"finding":[94],"variants":[96,202,278],"violate":[98],"given":[100,109],"property":[101,249],"expressed":[102],"Linear-Time":[104],"Logic":[105],"(LTL)":[106],"within":[107],"simulation":[110],"budget.":[111],"achieve":[113,178],"this,":[114],"perform":[116,176],"random":[117],"walks":[118],"system":[123],"seeking":[124],"accepting":[125],"lassos.":[126],"show":[128],"our":[130,145,196],"allows":[132],"us":[133],"find":[135],"much":[137],"faster":[138],"(up":[139],"16":[141],"times":[142],"according":[143],"experiments)":[146],"exhaustive":[148],"methods.":[149],"As":[150],"any":[151],"simulation-based":[152],"approach,":[153],"however,":[154],"risk":[156],"Type-1":[158],"error":[159],"exists.":[160],"provide":[162],"lower":[164],"bound":[165,169],"and":[166,279,290],"an":[167,247],"upper":[168],"simulations":[174],"desired":[180],"level":[181],"confidence.":[183],"empirical":[185],"study":[186],"involving":[187],"59":[188],"properties":[189],"over":[190],"three":[191],"studies":[193],"reveals":[194,239],"manages":[198],"discover":[200],"violating":[203,264],"41":[204],"properties.":[207],"This":[208],"indicates":[209],"can":[212,243],"act":[213],"as":[214],"coarse-grained":[216,237],"analysis":[217,238],"quickly":[220,275],"set":[223],"buggy":[225],"second":[228],"complements":[230],"one.":[233],"In":[234],"no":[241],"variant":[242,258],"guarantee":[244],"satisfy":[246],"intended":[248],"executions,":[253],"should":[255],"minimizes":[260],"probability":[262],"this":[265],"property.":[266],"Thus,":[267],"fine-grained":[271],"identifies":[276],"promising":[277],"accurately":[280],"estimates":[281],"violation":[283],"probability.":[284],"evaluate":[286],"different":[287],"selection":[288,299],"strategies":[289],"reveal":[291],"genetic":[294],"algorithm":[295],"combined":[296],"elitist":[298],"yields":[300],"best":[302],"results.":[303]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}