{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:20:48Z","timestamp":1767183648070,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T00:00:00Z","timestamp":1535932800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,9,3]]},"DOI":"10.1145\/3236950.3236956","type":"proceedings-article","created":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T12:09:54Z","timestamp":1534248594000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Symbolic Execution for JavaScript"],"prefix":"10.1145","author":[{"given":"Jos\u00e9 Fragoso","family":"Santos","sequence":"first","affiliation":[{"name":"Imperial College London, UK"}]},{"given":"Petar","family":"Maksimovi\u0107","sequence":"additional","affiliation":[{"name":"Imperial College London, UK, Mathematical Institute SASA, Serbia"}]},{"given":"Th\u00e9otime","family":"Grohens","sequence":"additional","affiliation":[{"name":"ENS Paris, France"}]},{"given":"Julian","family":"Dolby","sequence":"additional","affiliation":[{"name":"IBM Research, New York, USA"}]},{"given":"Philippa","family":"Gardner","sequence":"additional","affiliation":[{"name":"Imperial College London, UK"}]}],"member":"320","published-online":{"date-parts":[[2018,9,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/3220903.3221139"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11531142_19"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3106739"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660193.2660214"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3182657"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11804192_6"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575467_5"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44202-9_11"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.09.057"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/566171.566191"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/566172.566191"},{"volume-title":"Infer: An Automatic Program Verifier for Memory Safety of C Programs. In NASA Formal Methods - Third International Symposium, NFM 2011, Pasadena, CA, USA, April 18-20, 2011. Proceedings. 459--465","author":"Calcagno C.","key":"e_1_3_2_1_12_1","unstructured":"C. Calcagno and D. Distefano . 2011 . Infer: An Automatic Program Verifier for Memory Safety of C Programs. In NASA Formal Methods - Third International Symposium, NFM 2011, Pasadena, CA, USA, April 18-20, 2011. Proceedings. 459--465 . C. Calcagno and D. Distefano. 2011. Infer: An Automatic Program Verifier for Memory Safety of C Programs. In NASA Formal Methods - Third International Symposium, NFM 2011, Pasadena, CA, USA, April 18-20, 2011. Proceedings. 459--465."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"K. Claessen J. Dureg\u00e5rd and M. H. Palka. 2015. Generating constrained random data with uniform distribution. J. Funct. Program. 25 (2015).  K. Claessen J. Dureg\u00e5rd and M. H. Palka. 2015. Generating constrained random data with uniform distribution. J. Funct. Program. 25 (2015).","DOI":"10.1017\/S0956796815000143"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/351240.351266"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89439-1_13"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984027"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287653"},{"key":"e_1_3_2_1_18_1","volume-title":"The","author":"ECMA","unstructured":"ECMA TC39. 2011. The 5 th edition of the ECMAScript Language Specification. Technical Report. ECMA. ECMA TC39. 2011. The 5th edition of the ECMAScript Language Specification. Technical Report. ECMA.","edition":"5"},{"key":"e_1_3_2_1_19_1","unstructured":"ECMA TC39. 2017. Test262 test suite. https:\/\/github.com\/tc39\/test262.  ECMA TC39. 2017. Test262 test suite. https:\/\/github.com\/tc39\/test262."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660193.2660215"},{"volume-title":"2013 35th International Conference on Software Engineering (ICSE). IEEE, 752--761","author":"Feldthaus A.","key":"e_1_3_2_1_21_1","unstructured":"A. Feldthaus , M. Sch\u00e4fer , M. Sridharan , J. Dolby , and F. Tip . 2013. Efficient construction of approximate call graphs for JavaScript IDE services . In 2013 35th International Conference on Software Engineering (ICSE). IEEE, 752--761 . A. Feldthaus, M. Sch\u00e4fer, M. Sridharan, J. Dolby, and F. Tip. 2013. Efficient construction of approximate call graphs for JavaScript IDE services. In 2013 35th International Conference on Software Engineering (ICSE). IEEE, 752--761."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158138"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103663"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"B. Jacobs J. Smans P. Philippaerts F. Vogels W. Penninckx and F. Piessens. 2011. VeriFast: A powerful sound predictable fast verifier for C and Java. In NASA Formal Methods. Springer 41--55.   B. Jacobs J. Smans P. Philippaerts F. Vogels W. Penninckx and F. Piessens. 2011. VeriFast: A powerful sound predictable fast verifier for C and Java. In NASA Formal Methods. Springer 41--55.","DOI":"10.1007\/978-3-642-20398-5_4"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1529282.1529711"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03237-0_17"},{"key":"e_1_3_2_1_27_1","unstructured":"J. Jones. 2016. Priority Queue Data Structure. https:\/\/github.com\/jasonsjones\/queue-pri.  J. Jones. 2016. Priority Queue Data Structure. https:\/\/github.com\/jasonsjones\/queue-pri."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635904"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1127878.1127884"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635913"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2007.48"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1787526.1787545"},{"key":"e_1_3_2_1_34_1","unstructured":"npm. 2018. npm a package manager for javascript. https:\/\/www.npmjs.com.  npm. 2018. npm a package manager for javascript. https:\/\/www.npmjs.com."},{"key":"e_1_3_2_1_35_1","unstructured":"Changhee Park and Sukyoung Ryu. 2015. Scalable and Precise Static Analysis of JavaScript Applications via Loop-Sensitivity. In ECOOP. 735--756.  Changhee Park and Sukyoung Ryu. 2015. Scalable and Precise Static Analysis of JavaScript Applications via Loop-Sensitivity. In ECOOP. 735--756."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737991"},{"key":"e_1_3_2_1_37_1","unstructured":"Racket. 2017. The Racket Programming Language. racket-lang.org.  Racket. 2017. The Racket Programming Language. racket-lang.org."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676971"},{"key":"e_1_3_2_1_39_1","volume-title":"Separation Logic: A Logic for Shared Mutable Data Structures. In LICS.","author":"Reynolds C.","year":"2002","unstructured":"John C. Reynolds . 2002 . Separation Logic: A Logic for Shared Mutable Data Structures. In LICS. John C. Reynolds. 2002. Separation Logic: A Logic for Shared Mutable Data Structures. In LICS."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411286.1411292"},{"key":"e_1_3_2_1_41_1","unstructured":"M. Santos. 2016. Buckets-JS: A JavaScript Data Structure Library. https:\/\/github.com\/mauriciosantos\/Buckets-JS.  M. Santos. 2016. Buckets-JS: A JavaScript Data Structure Library. https:\/\/github.com\/mauriciosantos\/Buckets-JS."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2010.38"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46669-8_33"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786830"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31057-7_20"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2491978"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31987-0_28"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509578.2509586"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594340"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863553"},{"volume-title":"Web Technology Surveys","year":"2017","key":"e_1_3_2_1_51_1","unstructured":"W3Techs : Web Technology Surveys . 2017 . Usage of JavaScript for websites. https:\/\/w3techs.com\/technologies\/details\/cp-javascript\/all\/all. W3Techs: Web Technology Surveys. 2017. Usage of JavaScript for websites. https:\/\/w3techs.com\/technologies\/details\/cp-javascript\/all\/all."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2017.30"}],"event":{"name":"PPDP '18: The 20th International Symposium on Principles and Practice of Declarative Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","Goethe University Goethe University Frankfurt"],"location":"Frankfurt am Main Germany","acronym":"PPDP '18"},"container-title":["Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3236950.3236956","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3236950.3236956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:33Z","timestamp":1750210773000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3236950.3236956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,3]]},"references-count":51,"alternative-id":["10.1145\/3236950.3236956","10.1145\/3236950"],"URL":"https:\/\/doi.org\/10.1145\/3236950.3236956","relation":{},"subject":[],"published":{"date-parts":[[2018,9,3]]},"assertion":[{"value":"2018-09-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}