{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:03:38Z","timestamp":1757617418638,"version":"3.44.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T00:00:00Z","timestamp":1736899200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T00:00:00Z","timestamp":1736899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["MOE-T2EP20121-0011"],"award-info":[{"award-number":["MOE-T2EP20121-0011"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","award":["NRF-NRFFAI1-2019-0004"],"award-info":[{"award-number":["NRF-NRFFAI1-2019-0004"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NUS ODPRT","award":["R-252-000-685-13"],"award-info":[{"award-number":["R-252-000-685-13"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1908287, IIS-1939677, IIS-1942336"],"award-info":[{"award-number":["IIS-1908287, IIS-1939677, IIS-1942336"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Amazon Research Award"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form Methods Syst Des"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10703-024-00467-w","type":"journal-article","created":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T03:56:42Z","timestamp":1736913402000},"page":"170-194","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A scalable entropy estimator"],"prefix":"10.1007","volume":"66","author":[{"given":"Priyanka","family":"Golia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brendan","family":"Juba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuldeep S.","family":"Meel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,15]]},"reference":[{"key":"467_CR1","doi-asserted-by":"crossref","unstructured":"Backes M, K\u00f6pf B, Rybalchenko A (2009) Automatic discovery and quantification of information leaks. In: Proc. of SP","DOI":"10.1109\/SP.2009.18"},{"key":"467_CR2","doi-asserted-by":"crossref","unstructured":"Cern\u1ef3 P, Chatterjee K, Henzinger T.A (2011) The complexity of quantitative information flow problems. In: Proc. of CSF","DOI":"10.1109\/CSF.2011.21"},{"key":"467_CR3","doi-asserted-by":"crossref","unstructured":"Phan Q.-S, Malacaria P, Tkachuk O, P\u0103s\u0103reanu C.S (2012) Symbolic quantitative information flow. Proc. of ACM SIGSOFT","DOI":"10.1145\/2382756.2382791"},{"key":"467_CR4","doi-asserted-by":"crossref","unstructured":"Smith G (2009) On the foundations of quantitative information flow. In: Proc. of FOSSAC","DOI":"10.1007\/978-3-642-00596-1_21"},{"issue":"1","key":"467_CR5","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539702403645","volume":"35","author":"T Batu","year":"2005","unstructured":"Batu T, Dasgupta S, Kumar R, Rubinfeld R (2005) The complexity of approximating the entropy. SIAM J Comput 35(1):132\u2013150","journal-title":"SIAM J Comput"},{"key":"467_CR6","doi-asserted-by":"crossref","unstructured":"Valiant G, Valiant P (2011) Estimating the unseen: an n\/log (n)-sample estimator for entropy and support size, shown optimal via new clts. In: Proc. of STOC, pp. 685\u2013694","DOI":"10.1145\/1993636.1993727"},{"key":"467_CR7","doi-asserted-by":"crossref","unstructured":"Chakraborty S, Fischer E, Goldhirsh Y, Matsliah A (2016) On the power of conditional samples in distribution testing. SIAM Journal on Computing","DOI":"10.1137\/140964199"},{"issue":"3","key":"467_CR8","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/130945508","volume":"44","author":"CL Canonne","year":"2015","unstructured":"Canonne CL, Ron D, Servedio RA (2015) Testing probability distributions using conditional samples. SIAM J Comput 44(3):540\u2013616","journal-title":"SIAM J Comput"},{"key":"467_CR9","unstructured":"Onak K, Sun X (2018) Probability-revealing samples. In: Proc. of AISTATS . PMLR"},{"issue":"4","key":"467_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1597036.1597038","volume":"5","author":"S Guha","year":"2009","unstructured":"Guha S, McGregor A, Venkatasubramanian S (2009) Sublinear estimation of entropy and information distances. ACM Trans Algorithms (TALG) 5(4):1\u201316","journal-title":"ACM Trans Algorithms (TALG)"},{"key":"467_CR11","doi-asserted-by":"crossref","unstructured":"Golia P, Juba B, Meel K.S (2022) A scalable shannon entropy estimator. In: International Conference on Computer Aided Verification, pp. 363\u2013384 . Springer","DOI":"10.1007\/978-3-031-13185-1_18"},{"issue":"19","key":"467_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2018.v014a019","volume":"14","author":"J Acharya","year":"2018","unstructured":"Acharya J, Canonne CL, Kamath G (2018) A chasm between identity and equivalence testing with conditional queries. Theory Comput 14(19):1\u201346","journal-title":"Theory Comput"},{"key":"467_CR13","unstructured":"Goldreich O (2019) On the complexity of estimating the effective support size. Technical Report TR19-088, ECCC"},{"key":"467_CR14","doi-asserted-by":"crossref","unstructured":"K\u00f6pf B, Basin D (2007) An information-theoretic model for adaptive side-channel attacks. In: Proc. of CCS","DOI":"10.1145\/1315245.1315282"},{"key":"467_CR15","doi-asserted-by":"crossref","unstructured":"Chen S, Wang R, Wang X, Zhang K (2010) Side-channel leaks in web applications: A reality today, a challenge tomorrow. In: Proc. of SP","DOI":"10.1109\/SP.2010.20"},{"key":"467_CR16","doi-asserted-by":"crossref","unstructured":"Zhou Z, Qian Z, Reiter M.K, Zhang Y (2018) Static evaluation of noninterference using approximate model counting. In: Proc. of SP","DOI":"10.1109\/SP.2018.00052"},{"key":"467_CR17","doi-asserted-by":"crossref","unstructured":"Goldreich O, Vadhan S (1999) Comparing entropies in statistical zero knowledge with applications to the structure of szk. In: Proc. of CCC, pp. 54\u201373 . IEEE","DOI":"10.1109\/CCC.1999.766262"},{"key":"467_CR18","doi-asserted-by":"crossref","unstructured":"Borges M, Phan Q.-S, Filieri A, P\u0103s\u0103reanu C.S (2017) Model-counting approaches for nonlinear numerical constraints. In: NASA Formal Methods Symposium, pp. 131\u2013138 . Springer","DOI":"10.1007\/978-3-319-57288-8_9"},{"key":"467_CR19","doi-asserted-by":"crossref","unstructured":"Eiers W, Saha S, Brennan T, Bultan T (2019) Subformula caching for model counting and quantitative program analysis. In: 2019 34th IEEE\/ACM International Conference on Automated Software Engineering (ASE), pp. 453\u2013464 . IEEE","DOI":"10.1109\/ASE.2019.00050"},{"key":"467_CR20","unstructured":"Klebanov V (2012) Precise quantitative information flow analysis using symbolic model counting. QASA"},{"key":"467_CR21","doi-asserted-by":"crossref","unstructured":"Kadron \u0130.B, Rosner N, Bultan T (2020) Feedback-driven side-channel analysis for networked applications. In: Proceedings of the 29th ACM SIGSOFT International Symposium on Software Testing and Analysis, pp. 260\u2013271","DOI":"10.1145\/3395363.3397365"},{"key":"467_CR22","doi-asserted-by":"crossref","unstructured":"Rosner N, Kadron I.B, Bang L, Bultan T (2019) Profit: Detecting and quantifying side channels in networked applications. In: NDSS","DOI":"10.14722\/ndss.2019.23536"},{"key":"467_CR23","doi-asserted-by":"crossref","unstructured":"K\u00f6pf B, Rybalchenko A (2010) Approximation and randomization for quantitative information-flow analysis. In: 2010 23rd IEEE Computer Security Foundations Symposium, pp. 3\u201314 . IEEE","DOI":"10.1109\/CSF.2010.8"},{"key":"467_CR24","doi-asserted-by":"crossref","unstructured":"Thurley M (2006) sharpsat\u2013counting models with advanced component caching and implicit bcp. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 424\u2013429 . Springer","DOI":"10.1007\/11814948_38"},{"key":"467_CR25","unstructured":"Sharma S, Gupta R, Roy S, Meel K.S (2018) Knowledge compilation meets uniform sampling. In: Proc. of LPAR"},{"key":"467_CR26","doi-asserted-by":"crossref","unstructured":"Achlioptas D, Hammoudeh Z, Theodoropoulos P (2018) Fast sampling of perfectly uniform satisfying assignments. In: Proc. of SAT","DOI":"10.1007\/978-3-319-94144-8_9"},{"key":"467_CR27","doi-asserted-by":"crossref","unstructured":"Gupta R, Sharma S, Roy S, Meel K.S (2019) WAPS: Weighted and projected sampling. In: Proc. of TACAS","DOI":"10.1007\/978-3-030-17462-0_4"},{"key":"467_CR28","unstructured":"Dudek J.M, Vardi M.Y (2020) Parallel weighted model counting with tensor networks. arXiv preprint arXiv:2006.15512"},{"key":"467_CR29","doi-asserted-by":"crossref","unstructured":"Sharma S, Roy S, Soos M, Meel K.S (2019) Ganak: A scalable probabilistic exact model counter. In: Proc. IJCAI","DOI":"10.24963\/ijcai.2019\/163"},{"key":"467_CR30","doi-asserted-by":"crossref","unstructured":"Hoeffding W (1994) Probability inequalities for sums of bounded random variables. The collected works of Wassily Hoeffding, 409\u2013426","DOI":"10.1007\/978-1-4612-0865-5_26"},{"key":"467_CR31","doi-asserted-by":"crossref","unstructured":"Starr R.M (2011) General Equilibrium Theory: An Introduction. Cambridge University Press, New York . Chap. 9","DOI":"10.1017\/CBO9780511975356"},{"key":"467_CR32","doi-asserted-by":"crossref","unstructured":"Fremont D, Rabe M, Seshia S (2017) Maximum model counting. In: Proc. of AAAI","DOI":"10.1609\/aaai.v31i1.11138"},{"key":"467_CR33","doi-asserted-by":"crossref","unstructured":"Soos M, Gocht S, Meel K.S (2020) Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling. In: Proc. of CAV","DOI":"10.1007\/978-3-030-53288-8_22"},{"key":"467_CR34","unstructured":"QBF Solver Evaluation Portal 2017. http:\/\/www.qbflib.org\/qbfeval17.php"},{"key":"467_CR35","unstructured":"QBF Solver Evaluation Portal 2018. http:\/\/www.qbflib.org\/qbfeval18.php"},{"issue":"6","key":"467_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3125643","volume":"64","author":"G Valiant","year":"2017","unstructured":"Valiant G, Valiant P (2017) Estimating the unseen: improved estimators for entropy and other properties. J. ACM 64(6):1\u201341","journal-title":"J. ACM"},{"key":"467_CR37","doi-asserted-by":"crossref","unstructured":"Bultan T (2019) Quantifying information leakage using model counting constraint solvers. In: Working Conference on Verified Software: Theories, Tools, and Experiments, pp. 30\u201335 . Springer","DOI":"10.1007\/978-3-030-41600-3_3"},{"key":"467_CR38","doi-asserted-by":"crossref","unstructured":"Aydin A, Eiers W, Bang L, Brennan T, Gavrilov M, Bultan T, Yu F (2018) Parameterized model counting for string and numeric constraints. In: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, pp. 400\u2013410","DOI":"10.1145\/3236024.3236064"},{"key":"467_CR39","doi-asserted-by":"crossref","unstructured":"Bultan T (2019) Quantifying information leakage using model counting constraint solvers. In: Working Conference on Verified Software: Theories, Tools, and Experiments, pp. 30\u201335 . Springer","DOI":"10.1007\/978-3-030-41600-3_3"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-024-00467-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10703-024-00467-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-024-00467-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T03:21:49Z","timestamp":1757128909000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10703-024-00467-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,15]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["467"],"URL":"https:\/\/doi.org\/10.1007\/s10703-024-00467-w","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"type":"print","value":"0925-9856"},{"type":"electronic","value":"1572-8102"}],"subject":[],"published":{"date-parts":[[2025,1,15]]},"assertion":[{"value":"12 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}