{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T03:45:38Z","timestamp":1784259938355,"version":"3.55.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1109\/scam.2015.7335406","type":"proceedings-article","created":{"date-parts":[[2015,11,23]],"date-time":"2015-11-23T22:49:26Z","timestamp":1448318966000},"page":"101-110","source":"Crossref","is-referenced-by-count":7,"title":["Detecting function purity in JavaScript"],"prefix":"10.1109","author":[{"given":"Jens","family":"Nicolay","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carlos","family":"Noguera","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Coen","family":"De Roover","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wolfgang","family":"De Meuter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93900-9_22"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1145\/41625.41654","article-title":"A calculus for assignments in higherorder languages","author":"felleisen","year":"1987","journal-title":"Proceedings of the ACM SIGACT-SIGPLAN Symp Principles of Programming Languages"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2489804.2489808"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384680"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24276-2_9"},{"key":"ref5","article-title":"Pushdown control-flow analysis of higher-order programs","author":"earl","year":"0","journal-title":"Proceedings of the 2010 Workshop on Scheme and Functional Programming (Scheme 2010)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19861-8_7"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-540-30579-8_14","article-title":"Purity and side effect analysis for java programs","author":"salcianu","year":"2005","journal-title":"Lecture Notes in Computer Science"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2775052.2661098"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/978-3-642-23702-7_6","article-title":"Purity analysis: An abstract interpretation formulation","author":"madhavan","year":"2011","journal-title":"Static Analysis"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455793"}],"event":{"name":"2015 IEEE 15th International Working Conference on Source Code Analysis and Manipulation (SCAM)","location":"Bremen, Germany","start":{"date-parts":[[2015,9,27]]},"end":{"date-parts":[[2015,9,28]]}},"container-title":["2015 IEEE 15th International Working Conference on Source Code Analysis and Manipulation (SCAM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7321933\/7335391\/07335406.pdf?arnumber=7335406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T13:54:19Z","timestamp":1748699659000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7335406\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/scam.2015.7335406","relation":{},"subject":[],"published":{"date-parts":[[2015,9]]}}}