{"id":"https://openalex.org/W2839132370","doi":"https://doi.org/10.1145/3213846.3213867","title":"Symbolic path cost analysis for side-channel detection","display_name":"Symbolic path cost analysis for side-channel detection","publication_year":2018,"publication_date":"2018-07-12","ids":{"openalex":"https://openalex.org/W2839132370","doi":"https://doi.org/10.1145/3213846.3213867","mag":"2839132370"},"language":"en","primary_location":{"id":"doi:10.1145/3213846.3213867","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3213846.3213867","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3213846.3213867","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis","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/3213846.3213867","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011404640","display_name":"Tegan Brennan","orcid":"https://orcid.org/0000-0002-9988-8630"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tegan Brennan","raw_affiliation_strings":["University of California at Santa Barbara, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052862590","display_name":"Seemanta Saha","orcid":"https://orcid.org/0009-0005-6427-9068"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seemanta Saha","raw_affiliation_strings":["University of California at Santa Barbara, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039991493","display_name":"Tevfik Bultan","orcid":"https://orcid.org/0000-0003-2993-1215"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tevfik Bultan","raw_affiliation_strings":["University of California at Santa Barbara, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053134485","display_name":"Corina S. P\u0103s\u0103reanu","orcid":"https://orcid.org/0000-0002-5579-6961"},"institutions":[{"id":"https://openalex.org/I1280536761","display_name":"Ames Research Center","ror":"https://ror.org/02acart68","country_code":"US","type":"facility","lineage":["https://openalex.org/I1280536761","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Corina S. P\u0103s\u0103reanu","raw_affiliation_strings":["Carnegie Mellon Silicon Valley, USA / NASA Ames Research Center, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon Silicon Valley, USA / NASA Ames Research Center, USA","institution_ids":["https://openalex.org/I1280536761"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2932,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.90923371,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"27","last_page":"37"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9998999834060669,"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/T11424","display_name":"Security and Verification in Computing","score":0.9998999834060669,"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/T11241","display_name":"Advanced Malware Detection Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12479","display_name":"Web Application Security Vulnerabilities","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.8015655279159546},{"id":"https://openalex.org/keywords/control-flow-graph","display_name":"Control flow graph","score":0.7323886752128601},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.577433705329895},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5702462792396545},{"id":"https://openalex.org/keywords/control-flow","display_name":"Control flow","score":0.5268004536628723},{"id":"https://openalex.org/keywords/side-channel-attack","display_name":"Side channel attack","score":0.526205837726593},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5193715691566467},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.496086448431015},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.4824824631214142},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.4590756595134735},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31063640117645264},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2268221080303192},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.22014591097831726},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.1103958785533905}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8015655279159546},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.7323886752128601},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.577433705329895},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5702462792396545},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.5268004536628723},{"id":"https://openalex.org/C49289754","wikidata":"https://www.wikidata.org/wiki/Q2267081","display_name":"Side channel attack","level":3,"score":0.526205837726593},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5193715691566467},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.496086448431015},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.4824824631214142},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.4590756595134735},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31063640117645264},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2268221080303192},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.22014591097831726},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.1103958785533905}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3213846.3213867","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3213846.3213867","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3213846.3213867","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3213846.3213867","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3213846.3213867","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3213846.3213867","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.47999998927116394,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G1053051368","display_name":"EAGER: Collaborative Research: Leveraging Graph Databases for Incremental and Scalable Symbolic Analysis and Verification of Web Applications","funder_award_id":"1548848","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1618543994","display_name":null,"funder_award_id":"FA8750-15-2-0087","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G4713059963","display_name":null,"funder_award_id":"FA8750","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G6343952910","display_name":null,"funder_award_id":"CCF-1548848","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"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2839132370.pdf","grobid_xml":"https://content.openalex.org/works/W2839132370.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1480909796","https://openalex.org/W1613874182","https://openalex.org/W1777881387","https://openalex.org/W1934458198","https://openalex.org/W1964281299","https://openalex.org/W1992792191","https://openalex.org/W1995405030","https://openalex.org/W1997775274","https://openalex.org/W2006053872","https://openalex.org/W2013716714","https://openalex.org/W2037851672","https://openalex.org/W2048702750","https://openalex.org/W2060542629","https://openalex.org/W2092576944","https://openalex.org/W2096133993","https://openalex.org/W2107691219","https://openalex.org/W2119000119","https://openalex.org/W2125202010","https://openalex.org/W2125357166","https://openalex.org/W2138952175","https://openalex.org/W2151481990","https://openalex.org/W2293441536","https://openalex.org/W2515614845","https://openalex.org/W2546922927","https://openalex.org/W2626217303","https://openalex.org/W2758227629","https://openalex.org/W2766853874","https://openalex.org/W2809301752","https://openalex.org/W2949113315","https://openalex.org/W2963921811","https://openalex.org/W3007127761","https://openalex.org/W4240951837","https://openalex.org/W6744447974"],"related_works":["https://openalex.org/W4318620547","https://openalex.org/W2138385884","https://openalex.org/W2166895275","https://openalex.org/W2998775986","https://openalex.org/W157564837","https://openalex.org/W2080313875","https://openalex.org/W2011536294","https://openalex.org/W4210453401","https://openalex.org/W1724049288","https://openalex.org/W2150418816"],"abstract_inverted_index":{"Side-channels":[0],"in":[1,26,44,164,181,217,239],"software":[2,28],"are":[3,233],"an":[4,91],"increasingly":[5],"significant":[6],"threat":[7],"to":[8,84,104,120,129,196,208,227],"the":[9,16,64,69,109,122,133,154,165,177,198,206,211,218],"confidentiality":[10],"of":[11,19,41,68,93,115,124,162,201,261],"private":[12],"user":[13],"information,":[14,150],"and":[15,49,74,77,242,256,266],"static":[17],"detection":[18,40],"such":[20],"vulnerabilities":[21],"is":[22],"a":[23,35,47,50,54,80,105,116,160,240,259],"key":[24],"challenge":[25],"secure":[27],"development.":[29],"In":[30],"this":[31],"paper,":[32],"we":[33,62,243],"introduce":[34],"new":[36],"technique":[37,152],"for":[38,53,205],"scalable":[39],"side-":[42],"channels":[43],"software.":[45],"Given":[46],"program":[48,70],"cost":[51,82,88,97,113,213],"model":[52],"side-channel":[55,183],"(such":[56],"as":[57,251,253],"time":[58],"or":[59,210],"memory":[60],"usage),":[61],"decompose":[63],"control":[65,134,167,229],"flow":[66,135,168,230],"graph":[67],"into":[71],"nested":[72],"branch":[73,173],"loop":[75,202],"components,":[76],"compositionally":[78],"assign":[79],"symbolic":[81,222],"expression":[83],"each":[85],"component.":[86],"Symbolic":[87],"expressions":[89],"provide":[90],"over-approximation":[92],"all":[94],"possible":[95,112],"observable":[96,130,182],"values":[98,114],"that":[99,142,146,179,232],"components":[100],"can":[101],"generate.":[102],"Queries":[103],"satisfiability":[106],"solver":[107],"on":[108,148,172,258],"difference":[110,214],"between":[111,215],"component":[117],"allow":[118,194],"us":[119,195],"detect":[121],"presence":[123],"imbalanced":[125],"paths":[126,163,216,231],"(with":[127],"respect":[128],"cost)":[131],"through":[132],"graph.":[136,219],"When":[137],"combined":[138],"with":[139],"taint":[140],"analysis":[141],"identifies":[143],"conditional":[144],"statements":[145],"depend":[147],"secret":[149],"our":[151,237],"answers":[153],"following":[155],"question:":[156],"Does":[157],"there":[158],"exist":[159],"pair":[161],"program's":[166],"graph,":[169],"differing":[170],"only":[171],"conditions":[174],"influenced":[175],"by":[176,185],"secret,":[178],"differ":[180],"value":[184],"more":[186],"than":[187],"some":[188],"given":[189],"threshold?":[190],"Additional":[191],"optimization":[192],"queries":[193],"identify":[197],"minimal":[199],"number":[200],"iterations":[203],"necessary":[204],"above":[207],"hold":[209],"maximal":[212],"We":[220,235],"perform":[221],"execution":[223],"based":[224],"feasibility":[225],"analyses":[226],"eliminate":[228],"infeasible.":[234],"implemented":[236],"techniques":[238],"prototype,":[241],"demonstrate":[244],"its":[245,254],"favourable":[246],"performance":[247],"against":[248],"state-of-the-art":[249],"tools":[250],"well":[252],"effectiveness":[255],"scalability":[257],"set":[260],"sizable,":[262],"realistic":[263],"Java":[264],"server-client":[265],"peer-to-peer":[267],"applications.":[268]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}