{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:06Z","timestamp":1750221246834,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T00:00:00Z","timestamp":1531353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1548848"],"award-info":[{"award-number":["CCF-1548848"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-15-2-0087"],"award-info":[{"award-number":["FA8750-15-2-0087"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,12]]},"DOI":"10.1145\/3213846.3213867","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"27-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Symbolic path cost analysis for side-channel detection"],"prefix":"10.1145","author":[{"given":"Tegan","family":"Brennan","sequence":"first","affiliation":[{"name":"University of California at Santa Barbara, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seemanta","family":"Saha","sequence":"additional","affiliation":[{"name":"University of California at Santa Barbara, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tevfik","family":"Bultan","sequence":"additional","affiliation":[{"name":"University of California at Santa Barbara, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Corina S.","family":"P\u0103s\u0103reanu","sequence":"additional","affiliation":[{"name":"Carnegie Mellon Silicon Valley, USA \/ NASA Ames Research Center, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"{n. d.}. https:\/\/github.com\/Apogee-Research\/STAC\/tree\/master\/Engagement_ Challenges. ({n. d.}).  {n. d.}. https:\/\/github.com\/Apogee-Research\/STAC\/tree\/master\/Engagement_ Challenges. ({n. d.})."},{"key":"e_1_3_2_1_2_1","unstructured":"{n. d.}. https:\/\/github.com\/vlab-cs-ucsb\/coco-channel. ({n. d.}).  {n. d.}. https:\/\/github.com\/vlab-cs-ucsb\/coco-channel. ({n. d.})."},{"key":"e_1_3_2_1_3_1","unstructured":"{n. d.}. Space\/Time Analysis for Cybersecurity (STAC). https:\/\/www.darpa.mil\/ program\/space-time-analysis-for-cybersecurity. ({n. d.}).  {n. d.}. Space\/Time Analysis for Cybersecurity (STAC). https:\/\/www.darpa.mil\/ program\/space-time-analysis-for-cybersecurity. ({n. d.})."},{"key":"e_1_3_2_1_4_1","unstructured":"{n. d.}. Z3 API in Python. ({n. d.}). http:\/\/www.cs.tau.ac.il\/~msagiv\/courses\/asv\/ z3py\/guide-examples.htm  {n. d.}. Z3 API in Python. ({n. d.}). http:\/\/www.cs.tau.ac.il\/~msagiv\/courses\/asv\/ z3py\/guide-examples.htm"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/325694.325702"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Saswat Anand Corina P\u0103s\u0103reanu and Willem Visser. 2007. JPF\u2013SE: A symbolic execution extension to java pathfinder. Tools and Algorithms for the Construction and Analysis of Systems (2007) 134\u2013138.   Saswat Anand Corina P\u0103s\u0103reanu and Willem Visser. 2007. JPF\u2013SE: A symbolic execution extension to java pathfinder. Tools and Algorithms for the Construction and Analysis of Systems (2007) 134\u2013138.","DOI":"10.1007\/978-3-540-71209-1_12"},{"key":"e_1_3_2_1_7_1","unstructured":"Timos Antopoulos Paul Gazzillo Michael Hicks Eric Koskinen Tachio Terauchi and Shiyi Wei. 2017. Decomposition instead of self-composition for k-safety.  Timos Antopoulos Paul Gazzillo Michael Hicks Eric Koskinen Tachio Terauchi and Shiyi Wei. 2017. Decomposition instead of self-composition for k-safety."},{"key":"e_1_3_2_1_8_1","unstructured":"(2017).  (2017)."},{"volume-title":"Janalyzer: A Static Analysis Tool for Java Bytecode. (08\/2017","year":"2017","author":"Balasubramanian Daniel","key":"e_1_3_2_1_9_1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950362"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183440.3195039"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1090583.1648610"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046737"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134058"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2010.20"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of OOPSLA\u00e2\u0102\u017998 Workshop on Reflective Programming in C++ and Java","volume":"174","author":"Chiba Shigeru","year":"1998"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2756550"},{"key":"e_1_3_2_1_19_1","first-page":"76","article-title":"Tempest: A signal problem","volume":"35","author":"Friedman Jeffrey","year":"1972","journal-title":"NSA Cryptologic Spectrum"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-015-0100-7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/800152.804919"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.02.031"},{"key":"e_1_3_2_1_23_1","unstructured":"Vincent Hindriksen. {n. d.}. How expensive is an operation on a CPU. ({n. d.}). https:\/\/streamhpc.com\/blog\/2012-07-16\/ how-expensive-is-an-operation-on-a-cpu\/  Vincent Hindriksen. {n. d.}. How expensive is an operation on a CPU. ({n. d.}). https:\/\/streamhpc.com\/blog\/2012-07-16\/ how-expensive-is-an-operation-on-a-cpu\/"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.23"},{"key":"e_1_3_2_1_25_1","volume-title":"CHES","volume":"2","author":"Joye Marc","year":"2002"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/646761.706156"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/216633.216666"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.43"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/362835.362838"},{"key":"e_1_3_2_1_30_1","first-page":"269","article-title":"Quantifying Side-Channel Information Leakage from Web Applications","volume":"2012","author":"Mather Luke","year":"2012","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2016.34"},{"key":"e_1_3_2_1_32_1","first-page":"401","article-title":"Synthesis of Adaptive Side-Channel Attacks","volume":"2017","author":"Phan Quoc-Sang","year":"2017","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460299.1460314"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007905003094"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1543135.1542486"},{"key":"e_1_3_2_1_36_1","unstructured":"Reinhard Wilhelm Jakob Engblom Andreas Ermedahl Niklas Holsti Stephan Thesing David Whalley Guillem Bernat Christian Ferdinand Reinhold Heckmann Tulika Mitra etal 2008.  Reinhard Wilhelm Jakob Engblom Andreas Ermedahl Niklas Holsti Stephan Thesing David Whalley Guillem Bernat Christian Ferdinand Reinhold Heckmann Tulika Mitra et al. 2008."},{"key":"e_1_3_2_1_37_1","unstructured":"The worst-case execution-time problem\u00e2\u0102\u0164overview of methods and survey of tools. 7 3 (2008) 36.  The worst-case execution-time problem\u00e2\u0102\u0164overview of methods and survey of tools. 7 3 (2008) 36."}],"event":{"name":"ISSTA '18: International Symposium on Software Testing and Analysis","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Amsterdam Netherlands","acronym":"ISSTA '18"},"container-title":["Proceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3213846.3213867","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3213846.3213867","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3213846.3213867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:42Z","timestamp":1750212462000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3213846.3213867"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,12]]},"references-count":37,"alternative-id":["10.1145\/3213846.3213867","10.1145\/3213846"],"URL":"https:\/\/doi.org\/10.1145\/3213846.3213867","relation":{},"subject":[],"published":{"date-parts":[[2018,7,12]]},"assertion":[{"value":"2018-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}