{"id":"https://openalex.org/W4394769497","doi":"https://doi.org/10.1145/3597503.3639171","title":"Scalable Relational Analysis via Relational Bound Propagation","display_name":"Scalable Relational Analysis via Relational Bound Propagation","publication_year":2024,"publication_date":"2024-04-12","ids":{"openalex":"https://openalex.org/W4394769497","doi":"https://doi.org/10.1145/3597503.3639171"},"language":"en","primary_location":{"id":"doi:10.1145/3597503.3639171","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3597503.3639171","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3597503.3639171","source":null,"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the IEEE/ACM 46th International Conference on Software Engineering","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/3597503.3639171","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025973455","display_name":"Clay Stevens","orcid":"https://orcid.org/0000-0001-5399-9661"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Clay Stevens","raw_affiliation_strings":["Iowa State University, Ames, Iowa, USA"],"raw_orcid":"https://orcid.org/0000-0001-5399-9661","affiliations":[{"raw_affiliation_string":"Iowa State University, Ames, Iowa, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"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":["University of Nebraska-Lincoln, Lincoln, Nebraska, USA"],"raw_orcid":"https://orcid.org/0000-0001-6686-466X","affiliations":[{"raw_affiliation_string":"University of Nebraska-Lincoln, Lincoln, Nebraska, USA","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4312,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62642134,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"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.9993000030517578,"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.9993000030517578,"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/T10142","display_name":"Formal Methods in Verification","score":0.9984999895095825,"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/T10639","display_name":"Advanced Software Engineering Methodologies","score":0.998199999332428,"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/scalability","display_name":"Scalability","score":0.7259929180145264},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.709705114364624},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6999455094337463},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.6028854250907898},{"id":"https://openalex.org/keywords/relational-calculus","display_name":"Relational calculus","score":0.5277106165885925},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5261566042900085},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.4977593719959259},{"id":"https://openalex.org/keywords/syntax","display_name":"Syntax","score":0.4754768908023834},{"id":"https://openalex.org/keywords/relational-model","display_name":"Relational model","score":0.4674568772315979},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4352495074272156},{"id":"https://openalex.org/keywords/relational-algebra","display_name":"Relational algebra","score":0.413493812084198},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2988431453704834},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.23490506410598755},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19853904843330383},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18668889999389648},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.10197591781616211}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7259929180145264},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.709705114364624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6999455094337463},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.6028854250907898},{"id":"https://openalex.org/C99436015","wikidata":"https://www.wikidata.org/wiki/Q1722436","display_name":"Relational calculus","level":4,"score":0.5277106165885925},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5261566042900085},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.4977593719959259},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.4754768908023834},{"id":"https://openalex.org/C40207289","wikidata":"https://www.wikidata.org/wiki/Q755662","display_name":"Relational model","level":3,"score":0.4674568772315979},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4352495074272156},{"id":"https://openalex.org/C95916125","wikidata":"https://www.wikidata.org/wiki/Q840540","display_name":"Relational algebra","level":3,"score":0.413493812084198},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2988431453704834},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.23490506410598755},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19853904843330383},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18668889999389648},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.10197591781616211},{"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.1145/3597503.3639171","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3597503.3639171","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3597503.3639171","source":null,"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the IEEE/ACM 46th International Conference on Software Engineering","raw_type":"proceedings-article"},{"id":"pmh:oai:digitalcommons.unl.edu:csearticles-1373","is_oa":true,"landing_page_url":"https://digitalcommons.unl.edu/csearticles/341","pdf_url":null,"source":{"id":"https://openalex.org/S4306400577","display_name":"Lincoln (University of Nebraska)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114395901","host_organization_name":"University of Nebraska\u2013Lincoln","host_organization_lineage":["https://openalex.org/I114395901"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"School of Computing: Faculty Publications","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/3597503.3639171","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3597503.3639171","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3597503.3639171","source":null,"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the IEEE/ACM 46th International Conference on Software Engineering","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1431900076","display_name":null,"funder_award_id":"CCF-2124116","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2253649605","display_name":null,"funder_award_id":"CCF-1755890","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2811804406","display_name":"SHF: Small: Efficient Formal Analysis of Evolving Software Systems","funder_award_id":"1618132","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3518098868","display_name":"FMitF: Track I: Flow Modeling Meets Software Verification: Redesign Internet Congestion Control for Performance and Verifiability","funder_award_id":"2124116","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G459276330","display_name":"CRII: SHF: Leveraging Synthesis for Dynamic Design Space Analysis","funder_award_id":"1755890","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7568627600","display_name":null,"funder_award_id":"CCF-1618132","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G767239528","display_name":null,"funder_award_id":"CCF-2139845","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8621799104","display_name":"EAGER: CCF: SHF: Scalable Software Verification through Automated Derivation of Domain-Specific Optimization Tactics","funder_award_id":"2139845","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":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4394769497.pdf"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W1519503479","https://openalex.org/W1964812014","https://openalex.org/W1971373119","https://openalex.org/W1973938051","https://openalex.org/W1978483614","https://openalex.org/W1978679823","https://openalex.org/W2061636055","https://openalex.org/W2083755826","https://openalex.org/W2110076463","https://openalex.org/W2116675540","https://openalex.org/W2137339691","https://openalex.org/W2165014417","https://openalex.org/W2166602595","https://openalex.org/W2168617729","https://openalex.org/W2171516295","https://openalex.org/W2343825734","https://openalex.org/W2474759362","https://openalex.org/W2547023109","https://openalex.org/W2795289301","https://openalex.org/W2801250354","https://openalex.org/W2803079060","https://openalex.org/W2884432391","https://openalex.org/W2898878396","https://openalex.org/W2901407949","https://openalex.org/W2916306497","https://openalex.org/W2949805459","https://openalex.org/W3042771014","https://openalex.org/W3089899650","https://openalex.org/W3090398723","https://openalex.org/W3097816029","https://openalex.org/W3153176799","https://openalex.org/W4225968144","https://openalex.org/W4285163447","https://openalex.org/W4285490382"],"related_works":["https://openalex.org/W2085988990","https://openalex.org/W2056340443","https://openalex.org/W2005835473","https://openalex.org/W2378275298","https://openalex.org/W60748262","https://openalex.org/W3174970460","https://openalex.org/W2056147406","https://openalex.org/W2376710457","https://openalex.org/W206482712","https://openalex.org/W2156787493"],"abstract_inverted_index":{"Bounded":[0],"formal":[1,57,156],"analysis":[2,144,227,248,263],"techniques":[3,19],"(such":[4],"as":[5],"bounded":[6,56,197],"model":[7,198],"checking)":[8],"are":[9,40],"incredibly":[10],"powerful":[11],"tools":[12],"for":[13,87,229],"today's":[14],"software":[15],"engineers.":[16],"However,":[17],"such":[18],"often":[20],"suffer":[21],"from":[22,124],"scalability":[23,53],"challenges":[24],"when":[25],"applied":[26],"to":[27,36,82,99,116,128,191,245],"large-scale,":[28,239],"real-world":[29,240],"systems.":[30],"It":[31],"can":[32,44,135],"be":[33],"very":[34],"difficult":[35],"ensure":[37],"the":[38,50,70,73,80,85,101,104,107,112,129,137,143,147,151,185,193,208,226,230],"bounds":[39,86,102],"set":[41],"properly,":[42],"which":[43,163],"have":[45,164],"a":[46,64],"profound":[47],"impact":[48],"on":[49,103,119],"performance":[51],"and":[52,145,177,224],"of":[54,72,96,111,139,149,158,162,187,195,210,215,221,236,253],"any":[55,88],"analysis.":[58,152],"In":[59],"this":[60],"paper,":[61],"we":[62],"propose":[63],"novel":[65],"approach---relational":[66],"bound":[67,133,189,205],"propagation---which":[68],"leverages":[69],"semantics":[71],"underlying":[74],"relational":[75,89,132,188,196,204],"logic":[76],"formula":[77],"encoded":[78],"by":[79,142,218,233,250],"specification":[81],"automatically":[83],"tighten":[84],"specification.":[90],"Our":[91,200],"approach":[92,171],"applies":[93],"two":[94],"sets":[95],"semantic":[97],"rules":[98],"propagate":[100],"relations":[105,121],"via":[106],"abstract":[108],"syntax":[109],"tree":[110],"formula,":[113],"first":[114],"upward":[115],"higher-level":[117,126],"expressions":[118,127],"those":[120,125],"then":[122],"downward":[123],"relations.":[130],"Thus,":[131],"propagation":[134,190,206],"reduce":[136,246],"number":[138,209],"variables":[140,212],"examined":[141],"decrease":[146,192],"cost":[148,194],"performing":[150],"This":[153],"paper":[154],"presents":[155],"definitions":[157],"these":[159],"rules,":[160],"all":[161],"been":[165],"rigorously":[166],"proven.":[167],"We":[168],"realize":[169],"our":[170],"in":[172,213],"an":[173,219,234,251],"accompanying":[174],"tool,":[175],"Propter,":[176],"present":[178],"experimental":[179],"results":[180,201],"using":[181],"Propter":[182,242],"that":[183,203],"test":[184],"efficacy":[186],"checking.":[199],"demonstrate":[202],"reduces":[207],"primary":[211],"63.58%":[214],"tested":[216],"specifications":[217,232],"average":[220,235,252],"30.68%":[222],"(N=519)":[223],"decreases":[225],"time":[228,249],"subject":[231],"49.30%.":[237],"For":[238],"specifications,":[241],"was":[243],"able":[244],"total":[247],"68.14%":[254],"(N=25)":[255],"while":[256],"introducing":[257],"comparatively":[258],"little":[259],"overhead":[260],"(6.14%":[261],"baseline":[262],"time).":[264]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}