{"id":"https://openalex.org/W7167904837","doi":"https://doi.org/10.1145/3793656.3793700","title":"Profile-Guided Constraint Simplification for Symbolic Execution","display_name":"Profile-Guided Constraint Simplification for Symbolic Execution","publication_year":2026,"publication_date":"2026-04-12","ids":{"openalex":"https://openalex.org/W7167904837","doi":"https://doi.org/10.1145/3793656.3793700"},"language":null,"primary_location":{"id":"doi:10.1145/3793656.3793700","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3793656.3793700","pdf_url":null,"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 IEEE/ACM 14th International Conference on Formal Methods in Software Engineering","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3793656.3793700","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5122285451","display_name":"Roxana Shajarian","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Roxana Shajarian","raw_affiliation_strings":["School of Computing, University of Nebraska-Lincoln, Lincoln, Nebraska, USA"],"raw_orcid":"https://orcid.org/0009-0006-9103-0839","affiliations":[{"raw_affiliation_string":"School of Computing, University of Nebraska-Lincoln, Lincoln, Nebraska, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041622932","display_name":"Md Rashedul Hasan","orcid":"https://orcid.org/0009-0009-3417-4352"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Md Rashedul Hasan","raw_affiliation_strings":["School of Computing, University of Nebraska-Lincoln, Lincoln, NE, USA"],"raw_orcid":"https://orcid.org/0009-0009-3417-4352","affiliations":[{"raw_affiliation_string":"School of Computing, University of Nebraska-Lincoln, Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101518641","display_name":"Lisong Xu","orcid":"https://orcid.org/0000-0003-3465-4056"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lisong Xu","raw_affiliation_strings":["School of Computing, University of Nebraska-Lincoln, Lincoln, NE, USA"],"raw_orcid":"https://orcid.org/0000-0003-3465-4056","affiliations":[{"raw_affiliation_string":"School of Computing, University of Nebraska-Lincoln, Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030064922","display_name":"Hamid Bagheri","orcid":"https://orcid.org/0000-0001-6686-466X"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hamid Bagheri","raw_affiliation_strings":["School of Computing, University of Nebraska-Lincoln, Lincoln, NE, USA"],"raw_orcid":"https://orcid.org/0000-0001-6686-466X","affiliations":[{"raw_affiliation_string":"School of Computing, University of Nebraska-Lincoln, Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":21.2894,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.99356315,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"13","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.43950000405311584,"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/T10126","display_name":"Logic, programming, and type systems","score":0.43950000405311584,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.18240000307559967,"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/T10639","display_name":"Advanced Software Engineering Methodologies","score":0.09950000047683716,"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/symbolic-execution","display_name":"Symbolic execution","score":0.703499972820282},{"id":"https://openalex.org/keywords/concolic-testing","display_name":"Concolic testing","score":0.5695000290870667},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5472999811172485},{"id":"https://openalex.org/keywords/profiling","display_name":"Profiling (computer programming)","score":0.5407999753952026},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.5076000094413757},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5044999718666077},{"id":"https://openalex.org/keywords/symbolic-trajectory-evaluation","display_name":"Symbolic trajectory evaluation","score":0.4950999915599823},{"id":"https://openalex.org/keywords/symbolic-data-analysis","display_name":"Symbolic data analysis","score":0.4862000048160553},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.47600001096725464}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7419000267982483},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.703499972820282},{"id":"https://openalex.org/C11219265","wikidata":"https://www.wikidata.org/wiki/Q5158734","display_name":"Concolic testing","level":4,"score":0.5695000290870667},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5472999811172485},{"id":"https://openalex.org/C187191949","wikidata":"https://www.wikidata.org/wiki/Q1138496","display_name":"Profiling (computer programming)","level":2,"score":0.5407999753952026},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.5076000094413757},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5044999718666077},{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.4950999915599823},{"id":"https://openalex.org/C65620979","wikidata":"https://www.wikidata.org/wiki/Q7661176","display_name":"Symbolic data analysis","level":2,"score":0.4862000048160553},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.47600001096725464},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4230000078678131},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.42260000109672546},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.40709999203681946},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.3725000023841858},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.3529999852180481},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.328900009393692},{"id":"https://openalex.org/C2776095079","wikidata":"https://www.wikidata.org/wiki/Q489538","display_name":"The Symbolic","level":2,"score":0.32670000195503235},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.32170000672340393},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.319599986076355},{"id":"https://openalex.org/C33762810","wikidata":"https://www.wikidata.org/wiki/Q461671","display_name":"Data integrity","level":2,"score":0.31630000472068787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30660000443458557},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.27489998936653137},{"id":"https://openalex.org/C2781020372","wikidata":"https://www.wikidata.org/wiki/Q533093","display_name":"On the fly","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.25850000977516174},{"id":"https://openalex.org/C91071405","wikidata":"https://www.wikidata.org/wiki/Q1413145","display_name":"Program slicing","level":3,"score":0.2572000026702881},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.25440001487731934}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3793656.3793700","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3793656.3793700","pdf_url":null,"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 IEEE/ACM 14th International Conference on Formal Methods in Software Engineering","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3793656.3793700","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3793656.3793700","pdf_url":null,"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 IEEE/ACM 14th International Conference on Formal Methods in Software Engineering","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6182236828","display_name":null,"funder_award_id":"CCF-1755890, CCF-2139845, CCF-2124116","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1480909796","https://openalex.org/W1979345446","https://openalex.org/W1979693894","https://openalex.org/W1990880047","https://openalex.org/W2009489720","https://openalex.org/W2020703884","https://openalex.org/W2042033151","https://openalex.org/W2047694629","https://openalex.org/W2096449544","https://openalex.org/W2097444001","https://openalex.org/W2101512909","https://openalex.org/W2107147876","https://openalex.org/W2110908283","https://openalex.org/W2113864883","https://openalex.org/W2115273016","https://openalex.org/W2129487583","https://openalex.org/W2137530017","https://openalex.org/W2249191673","https://openalex.org/W2296669295","https://openalex.org/W2514974017","https://openalex.org/W2529069893","https://openalex.org/W2574017551","https://openalex.org/W2963723316","https://openalex.org/W2974748391","https://openalex.org/W3042771014","https://openalex.org/W4240738830","https://openalex.org/W4407130112","https://openalex.org/W4407878857","https://openalex.org/W7167904837"],"related_works":[],"abstract_inverted_index":{"Constraint":[0],"solving":[1,31],"remains":[2],"the":[3,126],"primary":[4],"bottleneck":[5],"in":[6,122],"symbolic":[7,34,60,107,153],"execution,":[8,50],"consuming":[9],"up":[10],"to":[11,28,64],"90%":[12],"of":[13,46,70],"analysis":[14],"time.":[15],"We":[16,109],"present":[17],"EVP":[18,37],"(Empirical":[19],"Value":[20],"Profiling),":[21],"a":[22,56,86,98,119,149],"framework":[23,68],"that":[24,41,59,78,89,102],"leverages":[25],"runtime":[26],"profiling":[27,147],"optimize":[29],"constraint":[30,99],"within":[32],"LLVM-based":[33,76],"execution":[35],"engines.":[36],"identifies":[38,90],"program":[39],"variables":[40,92],"consistently":[42],"assume":[43],"limited":[44],"sets":[45],"concrete":[47],"values":[48,81],"during":[49],"then":[51],"provides":[52],"this":[53],"information":[54],"through":[55],"standardized":[57],"API":[58,101],"executors":[61],"can":[62],"use":[63],"simplify":[65],"constraints.":[66],"Our":[67],"consists":[69],"three":[71],"decoupled":[72],"components:":[73],"(1)":[74],"an":[75],"profiler":[77],"tracks":[79],"variable":[80],"at":[82],"branch":[83],"points,":[84],"(2)":[85],"value":[87],"analyzer":[88],"limited-domain":[91],"using":[93],"configurable":[94],"thresholds,":[95],"and":[96],"(3)":[97],"simplification":[100],"integrates":[103],"with":[104,116],"any":[105],"SMT-based":[106],"executor.":[108],"demonstrate":[110],"EVP\u2019s":[111,133],"generalizability":[112],"by":[113,138],"integrating":[114],"it":[115],"KLEE,":[117],"achieving":[118],"12.4-85.2%":[120],"reduction":[121],"constraint-solving":[123],"time":[124],"across":[125],"benchmark":[127],"programs":[128],"while":[129],"maintaining":[130],"minimal":[131],"trade-offs.":[132],"modular":[134],"design":[135],"enables":[136],"adoption":[137],"existing":[139],"tools":[140],"without":[141],"major":[142],"architectural":[143],"changes,":[144],"establishing":[145],"empirical":[146],"as":[148],"practical":[150],"optimization":[151],"for":[152],"execution.":[154]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-07-11T00:00:00"}