{"id":"https://openalex.org/W7138451329","doi":"https://doi.org/10.48550/arxiv.2603.13963","title":"SeqTG: Scalable Combinatorial Test Generation via Sequential Integer Linear Programming","display_name":"SeqTG: Scalable Combinatorial Test Generation via Sequential Integer Linear Programming","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7138451329","doi":"https://doi.org/10.48550/arxiv.2603.13963"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.13963","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.13963","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.13963","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129709468","display_name":"Sitong Yang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang, Sitong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064524194","display_name":"Wanying Bao","orcid":"https://orcid.org/0000-0001-8278-8492"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bao, Wanying","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129653294","display_name":"Yinyin Song","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Song, Yinyin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067793798","display_name":"Yueting Cheng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cheng, Yueting","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129686039","display_name":"Qian Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Qian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5129696569","display_name":"Chao Wei","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wei, Chao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9189000129699707,"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"}},"topics":[{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9189000129699707,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.04190000146627426,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T13293","display_name":"Engineering and Test Systems","score":0.013500000350177288,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7064999938011169},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6675999760627747},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.5928999781608582},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5637999773025513},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5385000109672546},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.48249998688697815},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4081999957561493},{"id":"https://openalex.org/keywords/pipeline","display_name":"Pipeline (software)","score":0.3781000077724457},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.36169999837875366}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7064999938011169},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6675999760627747},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6650000214576721},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.5928999781608582},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5637999773025513},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5385000109672546},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.48249998688697815},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4512999951839447},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4408000111579895},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4081999957561493},{"id":"https://openalex.org/C43521106","wikidata":"https://www.wikidata.org/wiki/Q2165493","display_name":"Pipeline (software)","level":2,"score":0.3781000077724457},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.36169999837875366},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36160001158714294},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3540000021457672},{"id":"https://openalex.org/C128942645","wikidata":"https://www.wikidata.org/wiki/Q1568346","display_name":"Test case","level":3,"score":0.35350000858306885},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.3479999899864197},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.3402000069618225},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.3391999900341034},{"id":"https://openalex.org/C151552104","wikidata":"https://www.wikidata.org/wiki/Q7705809","display_name":"Test suite","level":4,"score":0.3167000114917755},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.28459998965263367},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.272599995136261},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.2637999951839447},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.2572999894618988},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.25600001215934753},{"id":"https://openalex.org/C80478641","wikidata":"https://www.wikidata.org/wiki/Q195771","display_name":"Sequential analysis","level":2,"score":0.25380000472068787},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.13963","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.13963","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.13963","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.13963","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Combinatorial":[0],"Testing":[1],"(CT)":[2],"is":[3],"essential":[4],"for":[5],"detecting":[6],"interaction-triggered":[7],"faults,":[8],"yet":[9],"generating":[10],"minimal":[11],"Covering":[12],"Arrays":[13],"under":[14],"complex":[15],"constraints":[16],"remains":[17],"an":[18,147],"unresolved":[19],"NP-hard":[20],"challenge.":[21],"Current":[22],"greedy":[23,111],"algorithms":[24],"are":[25],"highly":[26],"scalable":[27,89],"but":[28,39],"suffer":[29],"from":[30],"severe":[31],"``diminishing":[32],"returns'':":[33],"they":[34],"efficiently":[35],"cover":[36],"initial":[37],"interactions":[38,154],"produce":[40],"bloated,":[41],"redundant":[42],"test":[43,192],"suites":[44],"when":[45],"struggling":[46],"to":[47,69,83,123],"pack":[48],"the":[49,77,100,115,119,126,152,178],"final":[50],"few":[51],"difficult":[52],"pairs.":[53],"While":[54],"exact":[55,80],"mathematical":[56,81],"programming":[57],"could":[58],"theoretically":[59],"address":[60],"this":[61,73],"inefficiency,":[62],"it":[63],"has":[64],"historically":[65],"been":[66],"intractable":[67],"due":[68],"combinatorial":[70],"explosion.":[71],"In":[72],"paper,":[74],"we":[75],"pioneer":[76],"application":[78],"of":[79],"modeling":[82],"CT":[84],"by":[85],"introducing":[86],"SeqTG,":[87],"a":[88,105,109,137,160],"framework":[90],"based":[91],"on":[92],"Sequential":[93],"Integer":[94],"Linear":[95],"Programming":[96],"(ILP).":[97],"To":[98],"circumvent":[99],"scalability":[101],"barrier,":[102],"SeqTG":[103,185],"employs":[104],"novel":[106],"Warm-Start":[107],"strategy:":[108],"rapid":[110],"initialization":[112],"first":[113],"clears":[114],"``easy''":[116],"interactions,":[117],"allowing":[118],"rigorous":[120],"ILP":[121],"solver":[122],"exclusively":[124],"optimize":[125],"fragmented,":[127],"difficult-to-cover":[128],"remainder.":[129],"The":[130,181],"pipeline":[131],"operates":[132],"in":[133],"three":[134],"stages:":[135],"(1)":[136],"Constraint-First":[138],"phase":[139,150,163],"grouping":[140],"must-include":[141],"requirements":[142],"via":[143,166],"graph":[144],"partitioning;":[145],"(2)":[146],"Incremental":[148],"Optimization":[149],"targeting":[151],"remaining":[153],"with":[155],"sequential":[156],"ILP;":[157],"and":[158,173,195],"(3)":[159],"Global":[161],"Minimization":[162],"eliminating":[164],"redundancies":[165],"set-covering.":[167],"Extensive":[168],"evaluations":[169],"across":[170],"standard":[171],"benchmarks":[172],"200":[174],"large-scale":[175],"configurations":[176],"validate":[177],"framework's":[179],"efficacy.":[180],"results":[182],"demonstrate":[183],"that":[184],"effectively":[186],"eradicates":[187],"late-stage":[188],"bloat,":[189],"achieving":[190],"state-of-the-art":[191],"suite":[193],"compactness":[194],"strict":[196],"constraint":[197],"adherence.":[198]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-18T00:00:00"}